A Simple Optimal Randomized Algorithm for Sorting on the PDM

Abstract. 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 sorts in optimal time with high probablity and has all the desirable features for practical implementation.

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Sanguthevar Rajasekaran, Sandeep Sen
• Keywords: ISAAC 2005, Parallel Disks Model, Randomized Algorithm, Several Randomized Algorithms