Sciweavers

42 search results - page 1 / 9
» Asynchronous parallel disk sorting
Sort
View
SPAA
2003
ACM
13 years 10 months ago
Asynchronous parallel disk sorting
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 algor...
Roman Dementiev, Peter Sanders
ISHPC
2003
Springer
13 years 10 months ago
Distribution-Insensitive Parallel External Sorting on PC Clusters
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...
Minsoo Jeon, Dongseung Kim
IPPS
2005
IEEE
13 years 10 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
MST
2002
128views more  MST 2002»
13 years 4 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
ICPPW
2000
IEEE
13 years 9 months ago
A Practical Realization of Parallel Disks
Several models of parallel disks are found in the literature. These models have been proposed to alleviate the I/O bottleneck arising in handling voluminous data. These models hav...
Sanguthevar Rajasekaran, Xiao-ming Jin