TY - GEN
T1 - COMPLEXITY OF PARALLEL SORTING.
AU - auf der Heide, Friedhelm Meyer
AU - Wigderson, Avi
PY - 1985
Y1 - 1985
N2 - The authors consider PRAMs with arbitrary computational power for individual processors, infinitely large shared memory and priority write-conflict resolution. The main result is that sorting n integers with n processors requires OMEGA ( ROOT log n) steps in this strong model. It is also shown that computing any symmetric polynomial (e. g. , the sum or product) of n integers requires exactly log//2n steps, for any finite number of processors.
AB - The authors consider PRAMs with arbitrary computational power for individual processors, infinitely large shared memory and priority write-conflict resolution. The main result is that sorting n integers with n processors requires OMEGA ( ROOT log n) steps in this strong model. It is also shown that computing any symmetric polynomial (e. g. , the sum or product) of n integers requires exactly log//2n steps, for any finite number of processors.
UR - http://www.scopus.com/inward/record.url?scp=0022205585&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1985.58
DO - 10.1109/sfcs.1985.58
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0022205585
SN - 0818606444
SN - 9780818606441
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 532
EP - 540
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -