Large-scale sorting in parallel memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Simple randomized mergesort on parallel disks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
This report is an edited version of a proposal submitted to the NSF Institutional Infrastructure program in September 1987 and funded in July 1988. The financial data and other supplementary information have been omitted, but the technical sections are unchanged. The proposal builds on the current research of a broad spectrum of the Computer Science faculty and at the same time expands our computing paradigm in the direction of current and future changes in technology. The funded project subsequently named the Mammoth project, provides the infrastructure (equipment, its maintenance, and support staff) to investigate many questions concerning the management of massive amounts of information, its efficient storage and fast retrieval on large capacity secondary storage media, its movement in high-storage high-capacity networks, and the facilitation by fast large-main-memory machines of its complex manipulation. The Mammoth project both enhances and integrates various independently funded research projects that are summarized is the technical sections of this report. The reader can gain overview of the Mammoth-related aspects so much, but certainly not all, of the research activities of the Computer Science Faculty as they existed in the fall of 1987.