Performance Analysis of Merge Sort Algorithms
Joella Lobo, Sonia Kuwelkar
Abstract
Sorting of data is employed in numerous applications and plays a vital role in determining the overall performance, speed and power. There is much sorting technique's like the Bubble Sort, Quick Sort, Selection Sort, Insertion Sort, Merge Sort, Heap Sort etc. Out of these, the Merge sort works the best when sorting huge data sets. In this paper, five of these merge sorting algorithms namely serial merge sort, parallel merge sort, bitonic merge sort, odd-even merge sort and the modified merge sort are analyzed and comparison based on resource utilization, delay and area are made. These algorithms are designed and developed to work on FPGA's. They can be parallelized on the FPGA easily to get better performance. Based on the results the best algorithm for an application or problem instance can be selected.