| dc.contributor.author | Vitter, Jeffrey Scott | |
| dc.contributor.author | Nodine, Mark H. | |
| dc.date.accessioned | 2011-03-21T18:45:05Z | |
| dc.date.available | 2011-03-21T18:45:05Z | |
| dc.date.issued | 1993 | |
| dc.identifier.citation | J. S. Vitter and M. H. Nodine. “Large-Scale Sorting in Uniform Memory Hierarchies,” special issue on parallel I/O systems in Journal of Parallel and Distributed Computing, 17, January 1993, 107–114. An extended abstract appears in “Large-Scale Sorting in Parallel Memories,” Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA ’91), Hilton Head, SC, July 1991, 29–39. http://dx.doi.org/10.1006/jpdc.1993.1008 | |
| dc.identifier.uri | http://hdl.handle.net/1808/7211 | |
| dc.description.abstract | We present several e cient algorithms for sorting on the uniform
memory hierarchy (UMH), introduced by Alpern, Carter, and Feig, and its paral-
lelization P-UMH.We give optimal and nearly-optimal algorithms for a wide range of
bandwidth degradations, including a parsimonious algorithm for constant bandwidth.
We also develop optimal sorting algorithms for all bandwidths for other versions of
UMH and P-UMH, including natural restrictions we introduce called RUMH and
P-RUMH, which more closely correspond to current programming languages. | |
| dc.language.iso | en_US | |
| dc.publisher | Elsevier | |
| dc.title | Large-Scale Sorting in Uniform Memory Hierarchies | |
| dc.type | Article | |
| kusw.kuauthor | Vitter, Jeffrey Scott | |
| kusw.oastatus | fullparticipation | |
| dc.identifier.doi | 10.1006/jpdc.1993.1008 | |
| kusw.oaversion | Scholarly/refereed, author accepted manuscript | |
| kusw.oapolicy | This item meets KU Open Access policy criteria. | |
| dc.rights.accessrights | openAccess | |
