Name
Abstract | ||
|---|---|---|
Given an array X of n elements from a restricted domain of integers (1;n): The integer sorting problem is the rearrangement ofn integers in ascending order. We study the first optimal deter- ministic sublogarithmic algorithm for integer sorting on CRCW PRAM. We give two comments on the algorithm. The first comment is the algorithm not runs in sublogarithmic time for any distribution of input data. The second comment is the cost of the algorithm is not linear. Then, we modify the algorithm to be optimal in sense of cost with a restriction on the input data. Our modification algorithm has time complexity O( log n log log n) using nlog log n log n Sum-CRCW processors. |
Year | Venue | Keywords |
|---|---|---|
2006 | PDPTA | time complexity |
Field | DocType | Citations |
Integer,Log-log plot,Discrete mathematics,Binary logarithm,Computer science,Linear space,Parallel computing,Theoretical computer science,Integer sorting,Time complexity | Conference | 0 |
PageRank | References | Authors |
0.34 | 14 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hazem M. Bahig | 1 | 24 | 7.61 |