Improved Parallel Integer Sorting without Concurrent Writing

Information and Computation

Volumn 136, Issue 1, 1997, Pages 25-51

  Albers, Susanne ^a,b   Hagerup, Torben ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (37)

1. Ajtai, M., Komlós, J., and Szemerédi, E. (1983), An O(n log n) sorting network, in "Proceedings, 15th Annual ACM Symposium on Theory of Computing," pp. 1-9 .
2. Andersson, A. (1995), Sublogarithmic searching without multiplications, in "Proceedings, 36th Annual Symposium on Foundations of Computer Science," pp. 655-663.
3. Andersson, A., Hagerup, T., Nilsson, S., and Raman, R. (1995), Sorting in linear time?, in "Proceedings, 27th Annual ACM Symposium on the Theory of Computing," pp. 427-436.
4. Bast, H., and Hagerup, T. (1995), Fast parallel space allocation, estimation, and integer sorting, Inform. and Comput. 123, 72-110.
5. Batcher, K. E. (1968), Sorting networks and their applications, in "Proceedings, AFIPS Spring Joint Computer Conference, 32," pp. 307-314.
6. Berkman, O., and Vishkin, U. (1993), On parallel integer merging, Inform. and Comput. 106, 266-285.
7. 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.
8. Chaudhuri, S., and Hagerup, T. (1994), Prefix graphs and their applications, in "Proceedings, 20th International Workshop on Graph-Theoretic Concepts in Computer Science," Lecture Notes in Computer Science, Vol. 903, pp. 206-218, Springer-Verlag, Berlin.
9. Cole, R. (1988), Parallel merge sort, SIAM J. Comput. 17, 770-785.
10. Cole, R., and Vishkin, U. (1986), Deterministic coin tossing with applications to optimal parallel list ranking, Inform. and Control 70, 32-53.
11. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990), "Introduction to Algorithms," MIT Press, Cambridge, MA.
12. Fredman, M. L., and Willard, D. E. (1993), Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47, 424-436.
13. Gil, J., Matias, Y., and Vishkin, U. (1991), Towards a theory of nearly constant time parallel algorithms, in "Proceedings, 32nd Annual Symposium on Foundations of Computer Science," pp. 698-710.
14. Goodrich, M. T., Matias, Y., and Vishkin, U. (1993), Approximate parallel prefix computation and its applications, in "Proceedings, 7th International Parallel Processing Symposium," pp. 318-325.
15. Goodrich, M. T., Matias, Y., and Vishkin, U. (1994), Optimal parallel approximation for prefix sums and integer sorting, in "Proceedings, 5th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 241-250.
16. Hagerup, T. (1991), Constant-time parallel integer sorting, in "Proceedings, 23rd Annual ACM Symposium on Theory of Computing," pp. 299-306.
17. Hagerup, T., and Raman, R. (1992), Waste makes haste: Tight bounds for loose parallel sorting, in "Proceedings, 33rd Annual Symposium on Foundations of Computer Science," pp. 628-637.
18. Hagerup, T., and Raman, R. (1993), Fast deterministic approximate and exact parallel sorting, in "Proceedings, 5th Annual ACM Symposium on Parallel Algorithms and Architectures," pp. 346-355.
19. Hagerup, T., and Rüb, C. (1989), Optimal merging and sorting on the EREW PRAM, Inform. Process. Lett. 33, 181-185.
20. Hagerup, T., and Shen, H. (1990), Improved nonconservative sequential and parallel integer sorting, Inform. Process. Lett. 36, 57-63.
21. Jájá, J. (1992), "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA.
22. Kirkpatrick, D., and Reisch, S. (1984), Upper bounds for sorting integers on random access machines, Theoret. Comput. Sci. 28, 263-276.
23. Kruskal, C. P. (1983), Searching, merging, and sorting in parallel computation, IEEE Trans. Comput. 32, 942-946.
24. Kruskal, C. P., Rudolph, L., and Snir, M. (1990a), Efficient parallel algorithms for graph problems, Algorithmica 5, 43-64.
25. Kruskal, C. P., Rudolph, L., and Snir, M. (1990b), A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71, 95-132.
26. Matias, Y., and Vishkin, U. (1991a), On parallel hashing and integer sorting, J. Algorithms 12, 573-606.
27. Matias, Y., and Vishkin, U. (1991b), Converting high probability into nearly-constant time - With applications to parallel hashing, in "Proceedings, 23rd Annual ACM Symposium on Theory of Computing," pp. 307-316.
28. Paul, W. J., and Simon, J. (1980), Decision trees and random access machines, in "Proceedings, International Symposium on Logic and Algorithmic," Zürich, pp. 331-340.
29. Rajasekaran, S., and Reif, J. H. (1989), Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput. 18, 594-607.
30. Rajasekaran, S., and Sen, S. (1992), On parallel integer sorting, Acta Inform. 29, 1-15.
31. Raman, R. (1990), The power of collision: Randomized parallel algorithms for chaining and integer sorting, in "Proceedings, 10th Conference on Foundations of Software Technology and Theoretical Computer Science," Lecture Notes in Computer Science, Vol. 472, pp. 161-175, Springer-Verlag, Berlin.
32. Raman, R. (1991a), "The power of collision: Randomized parallel algorithms for chaining and integer sorting," Technical Report No. 336, Computer Science Department, University of Rochester, New York, March 1990 (revised January 1991).
33. Raman, R. (1991b), "Optimal sub-logarithmic time integer sorting on the CRCW PRAM," Technical Report No. 370, Computer Science Department, University of Rochester, New York, January 1991.
34. Thorup, M. (1996), On RAM priority queues, in "Proceedings, 7th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 59-67.
35. Vaidyanathan, R., Hartmann, C. R. P., and Varshney, P. K. (1993), Towards optimal parallel radix sorting, in "Proceedings, 7th International Parallel Processing Symposium," pp. 193-197.
36. van Emde Boas, P. (1977), Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6, 80-82.
37. Wagner, R. A., and Han, Y. (1986), Parallel algorithms for bucket sorting and the data dependent prefix problem, in "Proceedings, International Conference on Parallel Processing," pp. 924-930.