A simple and efficient parallel disk mergesort
- 1 June 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 232-241
- https://doi.org/10.1145/305619.305646
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A framework for simple sorting algorithms on parallel disk systems (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- Strategic directions in storage I/O issues in large-scale computingACM Computing Surveys, 1996
- Speeding up external mergesortIEEE Transactions on Knowledge and Data Engineering, 1996
- Simple randomized mergesort on parallel disksPublished by Association for Computing Machinery (ACM) ,1996
- Greed sortJournal of the ACM, 1995
- Algorithms for parallel memory, I: Two-level memoriesAlgorithmica, 1994
- Query evaluation techniques for large databasesACM Computing Surveys, 1993
- Merging sorted runs using large main memoryActa Informatica, 1989
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988