Fast Out-of-Core Sorting on Parallel Disk Systems
Matthew D. Pearson · 1999
This paper discusses our implementation of Rajasekaran’s ( l,m)-mergesort algo-rithm (LMM) for sorting on parallel disks. LMM is asymptotically optimal for large problems and has the additional advantage of a low constant in its I/O complexity. Our implementation is written in C using the ViC * I/O API for parallel disk systems. We compare the performance of LMM to that of the C library function qsort on a