More Efficient Parallel Integer Sorting

We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in { 0, 1, 2, ..., n 1/2} in O ((logn )3/2/loglogn ) time and O (n (logn /loglogn )1/2) operations. It also sorts n integers in {0, 1, 2,..., n −1} in O ((logn )3/2/loglogn ) time and O (n (logn /loglogn )1/2logloglogn ) operations. Previous best algorithm [13] on both cases has time complexity O (logn ) but operation complexity O (n (logn )1/2).

[1]  V. Benes.  On rearrangeable three-stage connecting networks , 1962 .

[2]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[3]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[4]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

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

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

[7]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[9]  Richard M. Karp,et al.  The complexity of parallel computation , 1986 .

[10]  Andrew V. Goldberg,et al.  Parallel symmetry-breaking in sparse graphs , 1987, STOC.

[11]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC.

[12]  Alejandro A. Schäffer,et al.  Recognizing Bellman-Ford-Orderable Graphs , 1988, SIAM J. Discret. Math..

[13]  Yijie Han,et al.  An optimal linked list prefix algorithms on a local memory computer , 1989, CSC '89.

[14]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[15]  Yijie Han,et al.  Matching partition a linked list and its optimization , 1989, SPAA '89.

[16]  Yijie Han,et al.  An Optimal Linked List Prefix Algorithm on a Local Memory Computer , 1991, IEEE Trans. Computers.

[17]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[18]  John H. Reif,et al.  Implementations of randomized sorting on large parallel machines , 1992, SPAA '92.

[19]  Susanne Albers,et al.  Improved parallel integer sorting without concurrent writing , 1992, SODA '92.

[20]  John H. Reif,et al.  Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[21]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[22]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[23]  Xiaojun Shen,et al.  Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs , 1999, SODA '99.

[24]  Yijie Han,et al.  Improved fast integer sorting in linear space , 2001, SODA '01.

[25]  Yijie Han.  Deterministic sorting in O(nlog log n) time and linear space , 2002, STOC '02.