Parallelization of Modified Merge Sort Algorithm

Abstract

Abstract:Modern architectures make possible development in new algorithms for large data sets and distributed computing. The newly proposed versions can benefit both from faster computing on the multi core architectures, and intelligent programming techniques that use efficient procedures available in the latest programming studios. Frequently used algorithms to sort arrays of data in NoSQL databases is merge sort, where as NoSQL we understand any database without typical SQL programming interpreter. The author describes how to use the parallelization of the sorting processes for the modified method of sorting by merging for large data sets. The subject of this research is the claim that the parallelization of the sorting method is faster and beneficial for multi-core systems. Presented results show how the number of processors influences the sorting performance. The results are presented in theoretical assumptions and confirmed in practical benchmark tests. The method is compared to other sorting methods like quick sort, heap sort, and merge sort to show potential efficiency.

Energy performance of parallel sort algorithms

“…A parallel modified sorting algorithm by merging four strings is presented in [17]. To merge four strings, logical indexing of the processors participating in the sort has been applied.…”

“…In each step of t, the algorithm first merges the n/2 2t-1 -element strings into a temporary array, and then merge the n/2 2t element strings from the temporary array into the input array by doing no more than 2 ⋅ 2 2t-2 + 2 ⋅ 2 2t-1 -2 comparisons. The sum of all comparisons performed by the algorithm is given that (17) and (18) As a result of substitution (19) The presented method was implemented in C# Visual Studio Ultimate 2013. Statistical surveys for samples range from 100 to 100 million elements, increasing the dimension 10 times for each subsequent.…”

“…Basic sorting algorithms, such as quick sort, sorting through packing and sorting by merging have been described in many works, among other things in [3,13,19]. Parallelized algorithm for fast sort [16] and parallelized merge sort algorithm [17] play a special role in increasing the efficiency of the ordering data sets, and reducing the energy consumed by the processors. Most of the work on energy efficiency [1,9,12,18] assumes that energy consumption is independent of the size of the problem.…”

“…Parallel computing issues and their use are described in [20]. The Parallel Fast Sort Algorithms and Parallel Modified Merge Sort Algorithm [16,17] methods are shown to reduce the energy consumption of large data sets.…”

Performance comparison analysis library communication cluster system using merge sort

“…Parallel mergesort is a modification of the old sequential mergesort, in which it supports parallel sorting. Parallel mergesort algorithm is relatively easy to set up since it has divide and conquer method, which can work in parallel [7].…”