Affiliation:
1. Purdue University, West Lafayette, IN
2. Carleton University, Ottawa, Ont., Canada
Abstract
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often difficult. Each disk can service only one read or write request at a time; the challenge is to keep the disks as busy as possible. In this article, we develop a randomized allocation discipline for parallel independent disks, called
randomized cycling
. We show how it can be used as the basis for an efficient distribution sort algorithm, which we call
randomized cycling distribution sort
(RCD). We prove that the expected I/O complexity of RCD is optimal. The analysis uses a novel reduction to a scenario with significantly fewer probabilistic interdependencies. We demonstrate RCD's practicality by experimental simulations. Using the randomized cycling discipline, algorithms developed for the unrealistic multihead disk model can be simulated on the realistic parallel disk model for the class of
multipass
algorithms, which make a complete pass through their data before accessing any element a second time. In particular, algorithms based upon the well-known distribution and merge paradigms of EM computation can be optimally extended from a single disk to parallel disks.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference22 articles.
1. The input/output complexity of sorting and related problems
2. Arge L. Vengroff D. E. and Vitter J. S. 2007. External-memory algorithms for processing line segments in geographic information systems. Algorithmica. to appear. 10.1007/s00453-006-1208-z Arge L. Vengroff D. E. and Vitter J. S. 2007. External-memory algorithms for processing line segments in geographic information systems. Algorithmica. to appear. 10.1007/s00453-006-1208-z
3. Optimal External Memory Interval Management
4. Simple randomized mergesort on parallel disks
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimal Parallel Sorting with Comparison Errors;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. External Sorting and Permuting;Encyclopedia of Algorithms;2016
3. External Sorting and Permuting;Encyclopedia of Algorithms;2015
4. External Sorting and Permuting;Encyclopedia of Algorithms;2008
5. Algorithms and Data Structures for External Memory;Foundations and Trends® in Theoretical Computer Science;2006