Parallel Multidimensional Lookahead Sorting Algorithm
This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads, word size, memory/processor communication ov...
Main Authors: | Fayez Gebali, Mohamed Taher, Ahmed M. Zaki, M. Watheq El-Kharashi, Ayman Tawfik |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8731843/ |
Similar Items
-
Parallelization of Modified Merge Sort Algorithm
by: Zbigniew Marszałek
Published: (2017-09-01) -
Parallel sorting algorithms /
by: 437127 Akl, Selim G.
Published: (1985) -
Comparative Analysis of OpenMP and MPI Parallel Computing Implementations in Team Sort Algorithm
by: Eko Dwi Nugroho, et al.
Published: (2023-11-01) -
Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms
by: Dominik Zurek, et al.
Published: (2013-01-01) -
A higher radix architecture for quantum carry-lookahead adder
by: Wang, Siyi, et al.
Published: (2024)