Waste makes haste: tight bounds for loose parallel sorting

Authors:
T. Hagerup;R. Raman
Affiliations:
Max-Planck-Inst. fur Info., Saarbrucken, Germany;Max-Planck-Inst. fur Info., Saarbrucken, Germany
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 3

Improved Deterministic Parallel Padded Sorting

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel

Journal of Parallel and Distributed Computing
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take Omega (log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more 'wasteful' convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1+o(1))n. The authors give very fast randomised CRCW PRAM algorithms for several padded-sorting problems. Applying only pairwise comparisons to the input and using kn processors, where 2