Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ISAAC
2005
Springer

favoriteEmaildiscussreport

113views Algorithms» more ISAAC 2005»

A Simple Optimal Randomized Algorithm for Sorting on the PDM

13 years 10 months ago

A Simple Optimal Randomized Algorithm for Sorting on the PDM

Download www.engr.uconn.edu

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 suﬀer 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.

Sanguthevar Rajasekaran, Sandeep Sen

Real-time Traffic

ISAAC 2005 | Parallel Disks Model | Randomized Algorithm | Several Randomized Algorithms |

claim paper

Related Content

» Optimal and Practical Algorithms for Sorting on the PDM

» PDM Sorting Algorithms That Take A Small Number of Passes

» Distribution sort with randomized cycling

» A Simple and Efficient Parallel Disk Mergesort

» Optimal Aggregation Algorithms for Middleware

» Optimal Randomized Algorithms for Local Sorting and SetMaxima

» Sorting and Selection on Distributed Memory Bus Computers

» A Randomized Sorting Algorithm on the BSP model

» WorkTime Optimal KMerge Algorithms on the PRAM

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Sanguthevar Rajasekaran, Sandeep Sen

Comments (0)