Analisis Kinerja Algoritma Quick Double Merge Sort Paralel Menggunakan openMP

2020 ◽  
Vol 11 (2) ◽  
pp. 95-102
Author(s):  
I Nyoman Aditya Yudiswara ◽  
Abba Suganda
Keyword(s):  
Parallel Algorithms ◽  
The Other ◽  
Sorting Algorithm ◽  
Data Parallelism ◽  
Parallel Sorting ◽  
Sequential Algorithms ◽  
Sorting Algorithms ◽  
Merge Sort ◽  
Sort Algorithm ◽  
Quick Sort

Processor technology currently tends to increase the number of cores more than increasing the clock speed. This development is very useful and becomes an opportunity to improve the performance of sequential algorithms that are only done by one core. This paper discusses the sorting algorithm that is executed in parallel by several logical CPUs or cores using the openMP library. This algorithm is named QDM Sort which is a combination of sequential quick sort algorithm and double merge algorithm. This study uses a data parallelism approach to design parallel algorithms from sequential algorithms. The data used in this study are the data that have not been sorted and also the data that has been sorted is integer type which is stored in advance in a file. The parameter measured to determine the performance of the QDM Sort algorithm is speedup. In a condition where a large amount of data is above 4096 and the number of threads in QDM Sort is the same as the number of logical CPUs, the QDM Sort algorithm has a better speedup compared to the other parallel sorting algorithms discussed in this study. For small amounts of data it is still better to use sequential sorting algorithm.

Fast parallel sorting algorithms

1978 ◽  
Vol 21 (8) ◽  
pp. 657-661 ◽  
Author(s):  
D. S. Hirschberg
Keyword(s):  
Parallel Sorting ◽  
Sorting Algorithms

scholarly journals An Experimental Analysis of Parallel Sorting Algorithms

1998 ◽  
Vol 31 (2) ◽  
pp. 135-167 ◽  
Author(s):  
G. E. Blelloch ◽  
C. E. Leiserson, B. M. Maggs
Keyword(s):  
Experimental Analysis ◽  
Parallel Sorting ◽  
Sorting Algorithms

A Quick Sorting Algorithm Adaptive to Massive Data with High Repetition Rate

2013 ◽  
Vol 834-836 ◽  
pp. 1002-1005
Author(s):  
Bao Ping Chen
Keyword(s):  
Experimental Data ◽  
Theoretical Analysis ◽  
Repetition Rate ◽  
Time Complexity ◽  
High Repetition Rate ◽  
Sorting Algorithm ◽  
Massive Data ◽  
Recursive Algorithms ◽  
High Repetition ◽  
Sorting Algorithms

Quick sorting is one of the sorting algorithms with good performance. However, there is a bottleneck of its performance in dealing with massive data with high repetition rate. Therefore, a new effective quick sorting algorithm is proposed in this study. This approach possesses the advantage of conciseness of quick sorting algorithms while avoiding the disadvantages of recursive algorithms. The time complexity is O(n), and the space complexity is O(1). Theoretical analysis and experimental data have shown that its performance is superior to the original quick sorting algorithm, and it is applicable to the processing of massive data with high repetition rate.

Sign in / Sign up

Export Citation Format

Share Document