Abstract: We all know that the most important procedure in managing data is its sorting. To perform sorting, one can choose different sorting algorithmic methods. But, all the various sorting algorithms do not result the same speed, execution time and efficiency at a given set of inputs. Hence, it is necessary to know which algorithm can give better result for a given platform and pre-defined data sets. This paper presents reader an experimental study of performance comparison for various parallel sorting algorithms. Proposed algorithm shows up to 50 times speed up as compare to serial and two fold speedup as compare to parallel algorithm.
Keywords: Bitonic sort, odd-even merge sort, parallel merge sort, parallel rank sort, complexity.