2005
DOI: 10.1007/11602613_55
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Optimal Randomized Algorithm for Sorting on the PDM

Abstract: 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 prob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…TSLink2 is capable of linking very large number of records. Even if the size of data is too big to fit into main memory, out-of-core sorting algorithms, for example [24][25][26][27][28] , could be employed to sort the two sequences described above in an out-of-core fashion.…”
mentioning
confidence: 99%
“…TSLink2 is capable of linking very large number of records. Even if the size of data is too big to fit into main memory, out-of-core sorting algorithms, for example [24][25][26][27][28] , could be employed to sort the two sequences described above in an out-of-core fashion.…”
mentioning
confidence: 99%