Sciweavers

42 search results - page 2 / 9
» Asynchronous parallel disk sorting
Sort
View
JACM
2006
98views more  JACM 2006»
13 years 5 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
COMAD
2008
13 years 6 months ago
Exploiting Asynchronous IO using the Asynchronous Iterator Model
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issu...
Suresh Iyengar, S. Sudarshan, Santosh Kumar 0002, ...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
13 years 10 months ago
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 ...
Sanguthevar Rajasekaran, Sandeep Sen
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
13 years 9 months ago
High-Performance Sorting on Networks of Workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sortin...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...
PDPTA
2004
13 years 6 months ago
On the Design and Performance of Remote Disk Drivers for Clusters of PCs
This paper presents the design and performance of remote disk drivers for clusters of Commodity-Off-The-Shelf PCs that fetch disk blocks over System Area Networks. The driver offe...
Vlad Olaru, Walter F. Tichy