Skip to main content
SpringerLink
Log in

Parallel Self-Index Integer Sorting

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

We consider the problem of sorting n integers when the elements are drawn from the restricted domain [1...n]. A new deterministic parallel algorithm for sorting n integers is obtained. Its running time is O(lognlog(n/logn)) using n/logn processors on EREW (exclusive read exclusive write) PRAM (parallel random access machine). Also, our algorithm was modified to become optimal when we use \(\sqrt n\) processors. This algorithm belongs to class EP (Efficient, Polynomial fast).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Albers and T.Hagerup. Improved integer sorting without concurrent writing. Information and Computation, 136:25–51, 1997.

    Google Scholar 

  2. H. Bast and T. Hagerup. Fast parallel space allocation, estimation, and integer sorting. Information and Computation, 123:72–110, 1995.

    Google Scholar 

  3. P. C. P. Bhatt, K. Diks, T. Hagerup, V.C. Prasad, T. Radzik, and S. Saxena. Improved deterministic parallel integer sorting. Information and Computation, 94:29–47,1991.

    Google Scholar 

  4. B. Chlebus. A parallel bucket sort. Information Processing Letters, 27:57–61, 1988.

    Google Scholar 

  5. R. Cole. Parallel merge sort. SIAM Journal of Computing, 17:770–785, 1988.

    Google Scholar 

  6. A. Dessmark and A. Lingas. Improved bounds for integer sorting in the EREW PRASM model. Parallel and Distributed Computing, 48:64–70, 1998.

    Google Scholar 

  7. T. Hagerup. Towards optimal parallel bucket sorting. Information and Computation, 75:39–51, 1987.

    Google Scholar 

  8. R. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, vol.A, pp.870–941. Elsevier Science Publisher, North Holland, Amsterdam, 1990.

    Google Scholar 

  9. D. Knuth. The Art of Computer Programming: Sorting and Searching, pp. 75–85. Addison-Wesley, Reading,MA, 1973.

    Google Scholar 

  10. C. Kruskal, L. Rudolph, and M. Snir. Efficient parallel algorithms for graph problems. Algorithmica, 5:43–64, 1990.

    Google Scholar 

  11. C. Kruskal, L. Rudolph, and M. Snir. A complexity theory of ef cient parallel algorithms. In Handbook of Theoretical Computer Science, vol. 7, pp. 95–132, 1990.

    Google Scholar 

  12. P. MacKenzie and Q. Stout. Ultra-fast expected time parallel algorithms. In Proceedings of the Sym posium on Discrete Algorithms, pp. 414–423, 1991.

  13. Y. Matias and U. Vishkin. On parallel hashing and integer sorting. In Proceedings of the 17th ICALP, Springer LNCS 443, pp. 729–743, 1990.

    Google Scholar 

  14. P. Ragde. The simplicity of compaction and chaining. In Proceedings of the 17th ICALP, Springer LNCS 443, pp.744–751, 1990.

    Google Scholar 

  15. S. Rajasekaran and J.H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal of Computing, 18:594–607, 1989.

    Google Scholar 

  16. S. Rajasekaran and S. Sen. On parallel integer sorting. Acta Informatica, 29:1–19, 1992.

    Google Scholar 

  17. R. Raman. The power of collision:Randomized parallel algorithm for chaining and integer sorting. In Proceedings of the 10th Conference on Foundation Software Technology and Theoretical Computer Science, LNCS vol. 472, pp. 161–175, 1990.

    Google Scholar 

  18. R. Raman. Optimal sub-logarithmic time integer sorting on the CRCW PRAM. Technical report no. 370. Computer Science Department, University of Rochester, New York, January 1991.

    Google Scholar 

  19. J. H. Reif. An optimal parallel algorithm for integer sorting. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 496–504, 1984.

  20. S. Saxena. Parallel integer sorting and simulation amongst CRCW models. Acta Informatica, 33(7):607–619, 1996.

    Google Scholar 

  21. R. Vaidyanathan, C. Hartmann, and P. Varshney. Parallel integer sorting using small operations. Acta Informatica, 32(1):79–92, 1995.

    Google Scholar 

  22. R. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. In Proceedings of the International Conference on Parallel Processing, pp. 924–930. Illinois, 1986.

  23. S. Wang. A new sort algorithm: Self-index sort. ACM SIGPLAN Notices, 31(3):28–36, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt

    Hazem M. Bahig, Sameh S. Daoud & Mahmoud K. A. Khairat

Authors
  1. Hazem M. Bahig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sameh S. Daoud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mahmoud K. A. Khairat
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bahig, H.M., Daoud, S.S. & Khairat, M.K.A. Parallel Self-Index Integer Sorting. The Journal of Supercomputing 22, 269–275 (2002). https://doi.org/10.1023/A:1015365901501

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015365901501

Search

Navigation