The input/output complexity of sorting and related problems
Communications of the ACM
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Simple randomized mergesort on parallel disks
Parallel Computing - Special double issue: parallel I/O
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Minimizing stall time in single and parallel disk systems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Online computation and competitive analysis
Online computation and competitive analysis
Optimal read-once parallel disk scheduling
Proceedings of the sixth workshop on I/O in parallel and distributed systems
A simple and efficient parallel disk mergesort
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
External memory algorithms and data structures
External memory algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Near-Optimal Parallel Prefetching and Caching
SIAM Journal on Computing
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal prefetching and caching for parallel I/O sytems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
Efficient out-of-core sorting algorithms for the Parallel Disks Model
Journal of Parallel and Distributed Computing
Scheduling multiple flows on parallel disks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
A simple optimal randomized algorithm for sorting on the PDM
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. To combat this problem, we define a useful and natural duality between writing to parallel disks and the seemingly more difficult problem of prefetching. We first explore this duality for applications involving read-once accesses using parallel disks. We get a simple linear time algorithm for computing optimal prefetch schedules and analyze the efficiency of the resulting schedules for randomly placed data and for arbitrary interleaved accesses to striped sequences. Duality also provides an optimal schedule for the integrated caching and prefetching problem, in which blocks can be accessed multiple times. Another application of this duality gives us the first parallel disk sorting algorithms that are provably optimal up to lower order terms. One of these algorithms is a simple and practical variant of multiway merge sort, addressing a question that has been open for some time.