Issue No. 04 - April (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.70810
The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied on the PDM model due to the fundamental nature of the problem. Several randomized algorithms are known for sorting. Most of the prior algorithms suffer from undue complications in memory layouts, implementation, or lack of tight analysis. In this paper we present a simple randomized algorithm that, with high probability}, sorts using an asymptotically optimal number of I/O operations and has all the desirable features for practical implementation. Recently, a considerable interest has been shown by researchers in developing algorithms for problem sizes of practical interest. In this paper we also present several novel algorithms for sorting on the PDM that take only a small number of passes through the data.
S. Rajasekaran and S. Sen, "Optimal and Practical Algorithms for Sorting on the PDM," in IEEE Transactions on Computers, vol. 57, no. , pp. 547-561, 2007.