FastSort: a distributed single-input single-output external sort
- 1 May 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 19 (2) , 94-101
- https://doi.org/10.1145/93605.98719
Abstract
External single-input single-output sorts can use multiple processors each with a large tournament replacement-selection in memory, and each with private disks to sort an input stream in linear elapsed time. Of course, increased numbers of processors, memories, and disks are required as the input file size grows. This paper analyzes the algorithm and reports the performance of an implementation.Keywords
This publication has 2 references indexed in Scilit:
- Merging sorted runs using large main memoryActa Informatica, 1989
- Sorting large files on a backend multiprocessorIEEE Transactions on Computers, 1988