Name
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). |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1023/A:1015365901501 | The Journal of Supercomputing |
Keywords | DocType | Volume |
parallel algorithms,self-index,integer sorting,EREW PRAM,optimal algorithms | Journal | 22 |
Issue | ISSN | Citations |
3 | 1573-0484 | 2 |
PageRank | References | Authors |
0.45 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hazem M. Bahig | 1 | 24 | 7.61 |
| Sameh S. Daoud | 2 | 8 | 2.66 |
| Mahmoud K. A. Khairat | 3 | 2 | 0.45 |