Fast parallel sorting algorithms

A parallel bucket-sort algorithm is presented that requires time <italic>O</italic>(log <italic>n</italic>) and the use of n processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted. A procedure is also presented to sort n numbers in time <italic>O</italic>(<italic>k</italic> log <italic>n</italic>) using <italic>n</italic><supscrpt><italic>1</italic>+<italic>1</italic>/<italic>k</italic></supscrpt> processors, for <italic>k</italic> an arbitrary integer. The model of computation for this procedure permits simultaneous fetches from the same memory location.

[1]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[2]  J. Ian Munro,et al.  Optimal Algorithms for Parallel Polynomial Evaluation , 1971, J. Comput. Syst. Sci..

[3]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[4]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[5]  Daniel S. Hirschberg,et al.  Parallel algorithms for the transitive closure and the connected component problems , 1976, STOC '76.

[6]  Eshrat Arjomandi.  A study of parallelism in graph theory. , 1976 .

[7]  Karl N. Levitt,et al.  Cellular arrays for the solution of graph problems , 1972, Commun. ACM.

[8]  Bill Shaw,et al.  THE PUBLIC USE OF PRIVATE INTEREST , 1980 .

[9]  Clark Weissman.  Secure computer operation with virtual machine partitioning , 1975, AFIPS '75.

[10]  Yoichi Muraoka,et al.  On the time required for a sequence of matrix products , 1973, CACM.

[11]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[12]  Fanica Gavril.  Merging with parallel processors , 1975, CACM.

[13]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[14]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[15]  Shimon Even,et al.  Parallelism in tape-sorting , 1974, Commun. ACM.

[16]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[17]  Donald E. Knuth,et al.  fundamental algorithms , 1969 .

[18]  David E. Muller,et al.  Bounds to Complexities of Networks for Sorting and for Switching , 1975, JACM.

[19]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

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

[21]  L. Csanky,et al.  Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).