A constant-time parallel sorting algorithm and its optical implementation

IEEE Micro ◽  
1995 ◽  
Vol 15 (3) ◽  
pp. 60-71 ◽  
Author(s):  
A. Louri ◽  
J.A. Hatch ◽  
Jongwhoa Na
Keyword(s):  
Constant Time ◽  
Sorting Algorithm ◽  
Parallel Sorting

scholarly journals An Efficient Parallel VLSI Sorting Architecture

VLSI Design ◽  
2000 ◽  
Vol 11 (2) ◽  
pp. 137-147 ◽  
Author(s):  
Yanjun Zhang ◽  
S. Q. Zheng
Keyword(s):  
Experimental Data ◽  
Theoretical Analysis ◽  
Constant Time ◽  
Sorting Algorithm ◽  
Fixed Size ◽  
Parallel Sorting ◽  
Termination Detection ◽  
Linear Arrays ◽  
Arbitrary Size ◽  
Sorting Network

We present a new parallel sorting algorithm that uses a fixed-size sorter iteratively to sort inputs of arbitrary size. A parallel sorting architecture based on this algorithm is proposed. This architecture consists of three components, linear arrays that support constant-time operations, a multilevel sorting network, and a termination detection tree, all operating concurrently in systolic processing fashion. The structure of this sorting architecture is simple and regular, highly suitable for VLSI realization. Theoretical analysis and experimental data indicate that the performance of this architecture is likely to be excellent in practice.

Constant-time parallel sorting algorithm and its optical implementation using smart pixels

1995 ◽  
Vol 34 (17) ◽  
pp. 3087 ◽  
Author(s):  
Ahmed Louri ◽  
James A. Hatch ◽  
Jongwhoa Na
Keyword(s):  
Constant Time ◽  
Sorting Algorithm ◽  
Parallel Sorting ◽  
Smart Pixels

A new parallel sorting algorithm based upon min-mid-max operations

1984 ◽  
Vol 24 (2) ◽  
pp. 187-195 ◽  
Author(s):  
S. S. Tseng ◽  
R. C. T. Lee
Keyword(s):  
Sorting Algorithm ◽  
Parallel Sorting

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.

Sign in / Sign up

Export Citation Format

Share Document