Abstract
Integer sorting is a special case of the sorting problem, where the elements have integer values in the range [0,n–1]. We evaluate the behavior and performance of two parallel integer sorting algorithms in practice. We have used Ada tasks facilities to simulate the parallel sorting algorithms on a machine consisting of 4-processors. Both algorithms are based on self-index method on EREW PRAM [3,6]. Also, we study the scalability of the two parallel algorithms and compare between them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akl, S.: Parallel Sorting Algorithms. Academic Press Inc., London (1985)
Akl, S.: Parallel Computation: Models and Methods. Prentice Hall, New Jersey (1997)
Bahig, H., Daoud, S., Khairat, M.: Parallel Self-Index Integer Sorting. J. of Supercomputing 22(3), 269–275 (2002)
Chandy, K.: Writing Correct Parallel Programs. In: Proc. 7th International Parallel Processing Symposium, pp. 630–634 (1993)
Karp, R., Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. In: Handbook of Theoretical Computer Science, vol. A, pp. 870–941. Elsevier Science Publisher, Amsterdam (1990)
Khairat, M., Daoud, S., Bahig, H.: Optimal Parallel Integer Sorting on EREW PRAM. In: Proc. of the 2000 Symposium on Performance Evaluation of Computer and Telecommunication Systems, Vancouver, British Columbia, pp. 370–374 (2000)
Knuth, D.: The Art of Computer Programming: Sorting and Searching. Addison-Wesley, Reading (1973)
Mayer, H., Jahnihen, S.: The Data-Parallel Ada Run-Time System, Simulation and Empirical Results. In: Proc. 7th International Parallel Processing Symposium, pp. 621–627 (1993)
None. Ada 95 Quality and Style: Guidelines for Professional Programmer. Department of Defense Ada Joint Program Office, Software Productivity Consortium (1995)
Paprzycki, M., Zalewski, J.: Parallel Computing in Ada: An Overview and Critique. ACM Ada Letter XVII(2), 55–62 (1997)
Perrott, R.: Parallel Languages. In: Zomaya, A. (ed.) Handbook of Parallel and Distributed Computing, pp. 843–864. MCGraw-Hill, New York (1996)
Sibeyn, J., Guillaume, F., Seidel, T.: Practical Parallel List Ranking. In: Lüling, R., Bilardi, G., Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1997. LNCS, vol. 1253, pp. 25–36. Springer, Heidelberg (1997)
Volz, R., Theriault, R., Smith, G., Waldrop, R.: Distributed and Parallel Execution in Ada83. In: third Workshop on Parallel and Distributed Real-Time System, pp. 52–61 (1995)
Wang, S.: A New Sort Algorithm: Self-Indexed Sort. ACM SIGPLAN Notices 31(3), 28–36 (1996)
Wolfe, M.: Program Portability Across Parallel Architectures -SIMD/MIMD/SMPD/Shared/Distributed. In: Proc. 8th International Parallel Processing Symposium, pp. 658–661 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bahig, H.M., Daoud, S.S. (2005). Practical Integer Sorting on Shared Memory. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_33
Download citation
DOI: https://doi.org/10.1007/11557654_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)