Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11557654_33 | HPCC |
Keywords | Field | DocType |
parallel algorithm,parallel integer,practical integer,special case,shared memory,self-index method,erew pram,integer value,ada tasks facility,sorting algorithm | Integer,Sorting network,Shared memory,Parallel random-access machine,Parallel algorithm,Computer science,Parallel computing,Random-access machine,Sorting,Integer sorting | Conference |
Volume | ISSN | ISBN |
3726 | 0302-9743 | 3-540-29031-1 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hazem M. Bahig | 1 | 24 | 7.61 |
| Sameh S. Daoud | 2 | 8 | 2.66 |