Improved fast integer sorting in linear space

Information and Computation

Volumn 170, Issue 1, 2001, Pages 81-94

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Algorithms; Bucket sorting; Integer sorting; Linear space; Parallel sorting

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; SORTING; VECTORS;

LINEAR SPACES;

COMPUTER SCIENCE;

EID: 0035841354     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3053     Document Type: Article

References (26)

1. Ajtai, M., Komlós, J., and Szemerédi, E. (1983), Sorting in c log n parallel steps, Combinatorica 3, 1-19.
2. Albers, S., and Hagerup, T. (1997), Improved parallel integer sorting without concurrent writing, Inform. and Comput. 136, 25-51.
3. Andersson, A. (1996). Fast deterministic sorting and searching in linear space, in "Proc. 1996 IEEE Symp. on Foundations of Computer Science," pp. 135-141.
4. Andersson, A., Hagerup, T., Nilsson, S., and Raman, R. (1995), Sorting in linear time? in "Proc. 1995 Symposium on Theory of Computing," pp. 427-436.
5. Bhatt, P. C. P., Diks, K., Hagerup, T., Prasad, V. C., Radzik, T., and Saxena, S. (1991), Improved deterministic parallel integer sorting, Inform and Comput. 94, 29-47.
6. van Emde Boas, P., Kaas, R., and Zijlstra, E. (1977), Design and implementation of an efficient Priority queue, Math. System Theory 10, 99-127.
7. Cole, R., (1987/88), An optimally efficient selection algorithm, Inform. Process. Lett. 26, 295-299.
8. Dessmark, A., and Lingas, A. (1998), Improved Bounds for Integer Sorting in the EREW PRAM Model, J. Parallel Distrib. Comput. 48, 64-70.
9. Dietzfelbinger, M., Hagerup, T., Katajainen, J., and Penttonen, M. (1997), A reliable randomized algorithm for the closest-pair problem, J. Algorithms 25, 19-51.
10. Fredman, M. L., and Willard, D. E. (1994), Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47, 424-436.
11. Hagerup, T., (1987), Towards optimal parallel bucket sorting, Inform. and Comput. 75, 39-51.
12. Hagerup, T., and Shen, H. (1990), Improved nonconservative sequential and parallel integer sorting, Inform. Process. Lett. 36, 57-63.
13. Han, Y. (2000), Fast integer sorting in linear space in "Proc. Symp. Theoretical Aspects of Computing (STACS'2000), February 2000." Lecture Notes in Computer Science, Vol. 1170, pp. 242-253.
14. Han, Y., and Shen, X. (1995), Conservative algorithms for parallel and sequential integer sorting, in "Proc. 1995 International Computing and Combinatorics Conference, August 1995." Lecture Notes in Computer Science, Vol. 959, pp. 324-333.
15. Han, Y., and Shen, X. (1999), Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs, in "Proc. 1999 Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, January 1999," pp. 419-428.
16. Kirkpatrick, D., and Reisch, S. (1984), Upper bounds for sorting integers on random access machines, Theoret. Comput. Sci. 28. 263-276.
17. Kruskal, C. P., Rudolph, L., and Snir, M. (1990), A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71, 1, 95-132.
18. Leighton, F. T. (1992). "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes." Morgan Kaufmann, San Mateo, CA.
19. Miltersen, P. B. (1994), Lower bounds for union-split-find related problems on random access machines, in "Proc. 26th STOC," pp. 625-634.
20. Rajasekaran, S., and Reif, J. (1989), Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput. 18, 594-607.
21. Rajasekaran, S., and Sen, S. (1992), On Parallel integer sorting, Acta Inform. 29, 1-15.
22. Raman, R. (1996), Priority queues: small, monotone and trans-dichotomous, in "Proc. 1996 European Symp. on Algorithms," Lecture Notes in Computer Science, Vol. 1136, pp. 121-137, Spinger-Verlag, Berlin/New York.
23. Thorup, M. (1997), Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations, in "Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA'97)," pp. 352-359.
24. Thorup, M. (1998), Fast deterministic sorting and priority queues in linear space, in "Proc. 1998 ACM-SIAM Symp. on Discrete Algorithms (SODA'98)," pp. 550-555.
25. Vaidyanathan, R., Hartmann, C. R. P., and Varshney, P. K. (1993), Towards optimal parallel radix sorting, in "Proc. 7th International Parallel Processing Symposium," pp. 193-197.
26. Wagner, R. A., and Han, Y. (1986), Parallel algorithms for bucket sorting and the data dependent prefix problem, in "Proc. 1986 International Conf. on Parallel Processing," pp. 924-930.