An Analysis of Efficiency Measures of Parallel Sorting Methodologies

Sorting is a high performance activity in the field of parallel computing which is commonly used in a large list of applications. Previous researches in parallel processing have provided the theory and analysis of parallel sorting methodologies and algorithms. Modern super-computers are advance, rapid and their architecture can be changed easily and significantly. In this paper, a study of performances of different sorting algorithms along with scenarios under read/write conflicts in EREW, CREW and CRCW sorts is given. In these approaches processors access the same shared memory location simultaneously. Similarly other sorting algorithms like bubble sort, selection sort, quick sort and merge sort work with their own way and hence they have their efficiency measures also. This study presents an efficiency analysis of different sorting algorithms so that a better algorithm can be designed to overcome existing privations.