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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Bahig, H. M., & Daoud, S. S. (2005). Practical integer sorting on shared memory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3726 LNCS, pp. 271–276). https://doi.org/10.1007/11557654_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
