269 search results - page 1 / 54 » Optimal Randomized Algorithms for Local Sorting and Set-Maxi... |
STOC
1990
ACM
13 years 8 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
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 ...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
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...
VLDB
2007
ACM
13 years 11 months ago
2007
ACM
In this paper we describe the design and implementation of CellSort − a high performance distributed sort algorithm for the Cell processor. We design CellSort as a distributed b...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...