Optimal Parallel Sorting in Multi-Level Storage (1994)
Cached
Download Links
- [www.cs.utexas.edu]
- [ftp.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF THE 5TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS |
| Citations: | 17 - 0 self |
BibTeX
@INPROCEEDINGS{Aggarwal94optimalparallel,
author = {Alok Aggarwal and C. Greg Plaxton},
title = {Optimal Parallel Sorting in Multi-Level Storage},
booktitle = {IN PROCEEDINGS OF THE 5TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS},
year = {1994},
pages = {659--668},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We adapt the Sharesort algorithm of Cypher and Plaxton to run on various parallel models of multi-level storage, and analyze its resulting performance. Sharesort was originally defined in the context of sorting n records on an n-processor hypercubic network. In that context, it is not known whether Sharesort is asymptotically optimal. Nonetheless, we find that Sharesort achieves optimal time bounds for parallel sorting in multi-level storage, under a variety of models that have been defined in the literature.
