Structured permuting in place on parallel disk systems
Pages 128 - 139
References
[1]
Alok Aggarwal and (3. Greg Plaxton. Opl;imal parallel sorting in multi-level storage. In Proceed- #ings of the 5th Annual A CM-SIAM Symposium on Discrete Algorithms, pages 659-668, January :t994.
[2]
Lars Arge. The buffer tree: A new technique Ibr optimal I/O-algorithms. In 4th Inte.rnational Workshop on Algorithms and Data Strucl:ures (Proceedings), Lecture Notes in Computer Science, number 955, pages 334-345. Springer- Verlag, August 1995.
[3]
Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications o} the A CM, 31(9):1116-1127, September 1988.
[4]
Yi-Jen Chiang, Michael T. Goodrich, Edward F. (?,rove, Roberto Tamassia, Darren Erik Vengroff, and Jeffrey Scott Vitter. External-meraory graph algorithms. In Proceedings o} the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, January 1995.
[5]
Thomas H. Cormen. Virtual Memory for Data- Parallel Computing. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992. Available as Technical Report MIT/LCS/TR- 559.
[6]
Thomas H. Cormen. Fast permuting in disk arrays. Journal of Parallel and Distributed Computing, 17(1-2):41-57, January and February 1993.
[7]
Thomas H. Cormen, Thomas Sundquist, and Leonard F. Wisniewski. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. Technical Report PCS- TR94-223, Dartmouth College Department of Computer Science, July 1994. Preliminary version appeared in Proceedings of the 5th Annual A CM Symposium on Parallel Algorithms and Architectures.
[8]
Alan Edelman, Steve HeUer, and S. Lennart Johnsson. Index transformation algorithms in a linear algebra framework. 1EEE Transactions on Parallel and Distributed Systems, 5(12):1302- 1309, December 1994.
[9]
Faith E. Fich, J. Inn Munro, and Patricio V. Poblete. Permuting in place. SlAM Journal on Computing, 24(2):266-278, April 1995.
[10]
Michael T. Goodrich, Jyh-Jong Tsay, Darren E. Vengroff, and Jeffrey Scott Vitter. Externalmemory computational geometry. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 714-723, November 1993.
[11]
Mark H. Nodine and Jeffrey Scott Vitter. Deterministic distribution sort in shared and distributed memory multiprocessors. In Proceedings of the 5th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 120-129, June 1993.
[12]
Jeffrey Scott Vitter and Elizabeth A. M. Shriver. Optimal disk I/O with parallel block transfer. In Proceedings of the Twenty Second Annual A CM Symposium on Theory o} Computing, pages 159- 169, May 1990.
[13]
Jeffrey Scott Vitter and Elizabeth A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2/3):110-147, August and September 1994.
[14]
Darren Erik Vengroff and Jeffrey Scott Vitter. I/O-efficient scientific computation using TPIE. In Seventh IEEE Symposium on Parallel and Distributed Processing, October 1995. To appear.
Index Terms
- Structured permuting in place on parallel disk systems
Recommendations
Permuting In Place
This paper addresses the fundamental problem of permuting the elements of an array of $n$ elements according to some given permutation. Our goal is to perform the permutation quickly using only a polylogarithmic number of bits of extra storage. The main ...
DCD—disk caching disk: a new approach for boosting I/O performance
ISCA '96: Proceedings of the 23rd annual international symposium on Computer architectureThis paper presents a novel disk storage architecture called DCD, Disk Caching Disk, for the purpose of optimizing I/O performance. The main idea of the DCD is to use a small log disk, referred to as cache-disk, as a secondary disk cache to optimize ...
Comments
Information & Contributors
Information
Published In
May 1996
140 pages
Copyright © 1996 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
- SIGOPS: ACM Special Interest Group on Operating Systems
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- IEEE-CS\TCOS: TC on Operating Systems & Application Environments
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 May 1996
Check for updates
Qualifiers
- Article
Conference
4IOPADS96
Sponsor:
- SIGMETRICS
- SIGOPS
- SIGACT
- SIGARCH
- IEEE-CS\TCOS
4IOPADS96: Fourth Annual Workshop on Input/Output in Parallel & Distributed Systems
May 27, 1996
Pennsylvania, Philadelphia, USA
Acceptance Rates
Overall Acceptance Rate 19 of 56 submissions, 34%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 262Total Downloads
- Downloads (Last 12 months)66
- Downloads (Last 6 weeks)22
Reflects downloads up to 18 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in