Tight comparison bounds on the complexity of parallel sorting
Journal Article
·
· SIAM J. Comput.; (United States)
The problem of sorting n elements using p processors in a parallel comparison model is considered. Lower and upper bounds which imply that for pgreater than or equal ton, the time complexity of this problem is THETA(log n/log(1+p/n) are presented. This complements (AKS-83) in settling the problem since the AKS sorting network established that for pless than or equal ton the time complexity is THETA(n log n/p). To prove the lower bounds we show that to achieve kless than or equal tolog n parallel time, we need ..cap omega..(n/sup 1+1/k/) processors.
- Research Organization:
- Dept. of Computer Science, School of Mathematical Sciences, Tel Aviv Univ., 69 978 Tel Aviv
- OSTI ID:
- 6190628
- Journal Information:
- SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 16:3; ISSN SMJCA
- Country of Publication:
- United States
- Language:
- English
Similar Records
The average complexity of deterministic and randomized parallel comparison-sorting algorithms
Optimal parallel merging and sorting without memory conflicts
The complexity of parallel sorting
Journal Article
·
Wed Nov 30 23:00:00 EST 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6337973
Optimal parallel merging and sorting without memory conflicts
Journal Article
·
Sat Oct 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5912451
The complexity of parallel sorting
Journal Article
·
Sat Jan 31 23:00:00 EST 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:6537775