The Community for Technology Leaders
Green Image
ABSTRACT
The authors investigate the feasibility and efficiency of a parallel sort-merge algorithm by considering its implementation of the JASMIN prototype, a backend multiprocessor built around a fast packet bus. They describe the design and implementation of a parallel sort utility and present and analyze the results of measurements corresponding to a range of file sizes and processor configurations.
INDEX TERMS
backend multiprocessor; parallel sort-merge algorithm; JASMIN prototype; fast packet bus; streamlined distributed operating system; database management systems; multiprocessing systems; sorting.
CITATION
W.K. Wilkinson, M. Beck, D. Bitton, "Sorting Large Files on a Backend Multiprocessor", IEEE Transactions on Computers, vol. 37, no. , pp. 769-778, July 1988, doi:10.1109/12.2222
88 ms
(Ver )