Practical integer sorting on shared memory
Bahig, Hazem; Daoud, Sameh S.;
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.
Other data
| Title | Practical integer sorting on shared memory | Authors | Bahig, Hazem ; Daoud, Sameh S. | Issue Date | 1-Dec-2005 | Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Start page | 271 | End page | 276 | ISBN | 3540290311 | ISSN | 03029743 | DOI | 10.1007/11557654_33 | Scopus ID | 2-s2.0-33646428903 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.