| | |
Summary: Improved Parallel Integer Sorting without
Concurrent Writing
Susanne Albersyz Torben Hagerupy
A preliminary version of this paper was presented at the 3rd Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA'92) in Orlando, Florida in January 1992.
yMax-Planck-Institut fur Informatik, D{66123 Saarbrucken, Germany. Supported in part by the Deutsche
Forschungsgemeinschaft, SFB 124, TP B2, VLSI Entwurfsmethoden und Parallelitat, and in part by the ESPRIT
Basic Research Actions Program of the EU under contracts No. 3075 and 7141 (projects ALCOM and ALCOM II).
zPart of this work was done while the author was a student at the Graduiertenkolleg Informatik, Univer-
sitat des Saarlandes, D{66041 Saarbrucken, Germany, and supported by a graduate fellowship of the Deutsche
Forschungsgemeinschaft.
1
Proposed running head: Improved parallel integer sorting
Contact author:
Susanne Albers
Max-Planck-Institut fur Informatik
Im Stadtwald
66123 Saarbrucken
Germany
2
|
