Getting More from Out-of-Core Columnsort

Chaudhry, Geeta; Cormen, Thomas H.

doi:10.1007/3-540-45643-0_11

Cited by 17 publications

(31 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chaudhry and Cormen [9,8] give a sophisticated distributed memory, parallel disk implementation of column sort. The algorithm also has the theoretical advantage of being deterministic.…”

Section: Related Workmentioning

confidence: 99%

“…We believe that such a system is a more likely candidate for running applications with massive data sets than an ordinary PC and should 8 In reality, incompatibilities between Linux and the controllers forced us to use five controllers in the following configuration: three controllers with one disk each on PCIbus 1, two controllers with two disks each on PCI-busses 2 and 3, and one disk on the on-board controller. 9 Modern disks store data at a roughly constant density so that the higher absolute speed of the outer parts of the disk allow around twice as high bandwidth as the inner parts.…”

Section: Pci−bussesmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous parallel disk sorting

Dementiev

Sanders

2003

Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures

View full text Add to dashboard Cite

We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algorithms have either suboptimal I/O volume or cannot guarantee that I/O and computations can always be overlapped. We give an efficient implementation that can (at least) compete with the best practical implementations but gives additional performance guarantees. For the experiments we have configured a state of the art machine that can sustain full bandwidth I/O with eight disks and is very cost effective.

show abstract

“…Chaudhry and Cormen [9,8] give a sophisticated distributed memory, parallel disk implementation of column sort. The algorithm also has the theoretical advantage of being deterministic.…”

Section: Related Workmentioning

confidence: 99%

Section: Pci−bussesmentioning

confidence: 99%

Asynchronous parallel disk sorting

Dementiev

Sanders

2003

Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…Being inherently oblivious in nature, they are able to achieve the desired parallelism more easily (see [8,9] for more details). Unfortunately, the number of passes made by these algorithms deteriorate rapidly from their optimal values with increasing problem sizes.…”

Section: Prior Algorithms and Our Resultsmentioning

confidence: 99%

A Simple Optimal Randomized Algorithm for Sorting on the PDM

Rajasekaran

Sen

2005

Algorithms and Computation

View full text Add to dashboard Cite

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.

show abstract

“…Similarly, the disk transfer times have significantly improved over the years where packing density and disk rotation speeds have greatly increased. Techniques like using parallel disks have also been useful to ensure that I-O bandwidth approaches processor speed [23,9,6]. Unfortunately the access latencies for both primary and secondary memory have not reduced in tandem with increase in memory bandwidth and processor speed, and I-O bottleneck is dominated by it.…”

Section: Motivationmentioning

confidence: 99%

Algorithmic Ramifications of Prefetching in Memory Hierarchy

Verma

Sen

2006

High Performance Computing - HiPC 2006

View full text Add to dashboard Cite

Abstract. External Memory models, most notable being the I-O Model [3], capture the effects of memory hierarchy and aid in algorithm design. More than a decade of architectural advancements have led to new features not captured in the I-O model -most notably the prefetching capability. We propose a relatively simple Prefetch model that incorporates data prefetching in the traditional I-O models and show how to design algorithms that can attain close to peak memory bandwidth. Unlike (the inverse of) memory latency, the memory bandwidth is much closer to the processing speed, thereby, intelligent use of prefetching can considerably mitigate the I-O bottleneck. For some fundamental problems, our algorithms attain running times approaching that of the idealized Random Access Machines under reasonable assumptions. Our work also explains the significantly superior performance of the I-O efficient algorithms in systems that support prefetching compared to ones that do not.

show abstract

Getting More from Out-of-Core Columnsort

Cited by 17 publications

References 4 publications

Asynchronous parallel disk sorting

Asynchronous parallel disk sorting

A Simple Optimal Randomized Algorithm for Sorting on the PDM

Algorithmic Ramifications of Prefetching in Memory Hierarchy

Contact Info

Product

Resources

About