论文信息 - The complexity of parallel sorting

The complexity of parallel sorting

We consider PRAM's with arbitrary computational power for individual processors, infinitely large shared memory and "priority" writeconflict resolution. The main result is that sorting n integers with n processors requires Ω(√log n) steps in this strong model. We also show that computing any symmetric polynomial (e.g. the sum or product) of n integers requires exactly log2n steps, for any finite number of processors.

Friedhelm Meyer auf der Heide | Avi Wigderson

[1] P. Erdös,et al. A combinatorial theorem , 1950 .

[2] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[3] Friedhelm Meyer auf der Heide,et al. On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication , 1984, FOCS.

[4] E. Szemerédi,et al. Sorting inc logn parallel steps , 1983 .

[5] Friedhelm Meyer auf der Heide,et al. One, two, three . . . infinity: lower bounds for parallel computation , 1985, STOC '85.

[6] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[7] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[8] Ian Parberry. A complexity theory of parallel computation , 1984 .

[9] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.