A parallel bucket sort☆
References (16)
- et al.
Fast probabilistic algorithms for hamiltonian paths and matchings
J. Comput. System Sci.
(1979) - et al.
Routing, merging, and sorting on parallel models of computation
J. Comput. System Sci.
(1985) Parallel computation and conflicts in memory access
Inform. Process. Lett.
(1982)- et al.
Finding the maximum, merging and sorting on a parallel computation model
J. Algorithms
(1981) - et al.
The Design and Analysis of Computer Algorithms
(1974) - et al.
An O(n log n) sorting network
Proc. 15th Ann. ACM Symp. on the Theory of Computing
(1983) The parallel evaluation of general arithmetic expressions
J. Assoc. Comput. Mach.
(1974)A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations
Ann. Math. Statist.
(1952)
There are more references available in the full text version of this article.
Cited by (12)
ERCW PRAMs and optical communication
1998, Theoretical Computer ScienceOdd-even, compare-exchange parallel sorting
1994, Microprocessing and MicroprogrammingHybridsort revisited and parallelized
1989, Information Processing LettersParallel iterated bucket sort
1989, Information Processing LettersParallel bucket sort algorithm on optical chained-cubic tree interconnection network
2023, Research SquareBig data processing with 1D-Crosspoint Arrays
2023, International Journal of Parallel, Emergent and Distributed Systems
- ☆
This work was partly prepared while the author was visiting the Institute of Technical Cybernetics at the Slovac Academy of Sciences at Bratislava.
Copyright © 1988 Published by Elsevier B.V.