Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 105-136

  Cormen, Thomas H ^a   Sundquist, Thomas ^b,c   Wisniewski, Leonard F ^a,d  

^a Dartmouth College   (United States)

^b Lamont Doherty Earth Observatory   (United States)

^c Secure Computing Corporation   (United States)

^d SUN MICROSYSTEMS   (United States)

Author keywords

Bit defined permutations; BMMC permutations; Matrix factoring; Parallel disk systems; Parallel I O; Potential functions; Universal lower bounds

Indexed keywords

ALGORITHMS; INPUT OUTPUT PROGRAMS; MAGNETIC DISK STORAGE; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; VECTORS;

BIT-MATRIX-MULTIPLY/COMPLEMENT (BMMC) PERMUTATIONS; BIT/PERMUTE/COMPLEMENT (BPC) PERMUTATION ALGORITHMS; MATRIX FACTORING; PARALLEL DISK SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032057868     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795283681     Document Type: Article

References (28)

1. A. AGGARWAL, A. K. CHANDRA, AND M. SNIR, Hierarchical memory with block transfer, in Proceedings of the 28th Annual Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1987, pp. 204-216.
2. A. AGGARVVAL AND J. S. VITTER, The input/output complexity of sorting and related problems, Comm. ACM, 31 (1988), pp. 1116-1127.
3. L. ARGE,The buffer tree: A new technique for optimal I/O-algorithms, in 4th International Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 955, Springer-Verlag, New York. 1995, pp. 334-345.
4. L. ARGE, The I/O-complexity of ordered binary-decision diagram manipulation, in Proceedings of the 6th International Symposium on Algorithms and Computations (ISAAC '95), Lecture Notes in Computer Science 1004, J. Staples, P. Eades, N. Katoh, and A. Moffat, eds., Springer-Verlag, New York, 1995, pp. 82-91.
5. L. ARGE, D. E. VENGROFF, AND J. S. VITTER, External-memory algorithms for processing line segments in geographic information systems, in Proceedings of the Third Annual European Symposium on Algorithms (ESA '95), Lecture Notes in Computer Science 979, P. Spirakis, ed., Springer-Verlag, New York, 1995, pp. 295-310.
6. R. D. BARVE, E. F. GROVE, AND J. S. VITTER, Simple randomized mergesort for parallel disks, in Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1996, pp. 109-118.
7. P. CHEN, G. GIBSON, R. H. KATZ, D. A. PATTERSON, AND M. SCHULZE, Two Papers on RAIDs. Tech. Report UCB/CSD 88/479, Computer Science Division (EECS), University of California, Berkeley, 1988.
8. Y.-J. CHIANG, M. T. GOODRICH, E. F. GROVE, R. TAMASSIA, D. E. VENGROFF, AND J. S. VITTER, External-memory graph algorithms, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1995, pp. 139-149.
9. T. H. CORMEN, Virtual Memory for Data-Parallel Computing, Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1992; also available as Technical Report MIT/LCS/TR-559.
10. T. H. CORMEN, Fast permuting in disk arrays, J. Parallel Distrib. Computing, 17 (1993), pp. 41-57.
11. T. H. CORMEX AND M. HIRSCHL, Early experiences in evaluating the Parallel Disk Model with the ViCz.ast; implementation, Parallel Comput., 23 (1997), pp. 571-600.
12. T. H. CORMEN AND D. M. NICOL, Performing out-of-core FFTs on parallel disk systems, Tech. Report PCS-TR96-294, Department of Computer Science, Dartmouth College, Hanover, NH, 1996; Parallel Comput., to appear.
13. T. H. CORMEN AND D. M. NICOL, Performing out-of-core FFTs on parallel disk systems, Tech. Report PCS-TR96-294, Department of Computer Science, Dartmouth College, Hanover, NH, 1996; Parallel Comput., to appear.
14. S. R. CUSHMAN, A Multiple Discrete Pass Algorithm on a DEC Alpha 2100, Tech. Report PCSTR95-259, Department of Computer Science, Dartmouth College, Hanover, NH, 1995.
15. J. M. DEL ROSARIO AND A. CHOUDHARY, High-performance I/O for massively parallel computers, IEEE Computer, (1994), pp. 59-67.
16. A. EDELMAN, S. HELLER, AND S. L. JOHNSSON, Index transformation algorithms in a linear algebra framework, IEEE Trans. Parallel Distributed Systems, 5 (1994), pp. 1302-1309.
17. R. W. FLOYD, Permuting information in idealized two-level storage, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 105-109.
18. G. A. GIBSON, Redundant Disk Arrays: Reliable, Parallel Secondary Storage, The MIT Press, Cambridge, MA, 1992; also available as Tech. Report UCB/CSD 91/613, Computer Science Division (EECS), University of California, Berkeley, 1991.
19. M. T. GOODRICH, J.-J. TSAY, D. E. VENGROFF, AND J. S. VITTER, External-memory computational geometry, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1993, pp. 714-723.
20. S. L. JOHNSSON AND C.-T. Ho, Generalized shuffle permutations on boolcan cubes, J. Parallel Distrib. Computing, 16 (1992), pp. 1-14.
21. S. LANG, Linear Algebra, 3rd ed., Springer-Verlag, New York, 1987.
22. M. H. NODINE AND J. S. VITTER, Deterministic distribution sort in shared and distributed memory multiprocessors, in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 120-129.
23. M. H. NODINE AND J. S. VITTER, Greed sort: Optimal deterministic sorting on parallel disks, J. Assoc. Comput. Mach., 42 (1995), pp. 919-933.
24. G. STRANG, Linear Algebra and Its Applications, 3rd ed. Harcourt Brace Jovanovich, San Diego, CA, 1988.
25. J. S. VITTER AND E. A. M. SHRIVER, Algorithms for parallel memory I: Two-level memories, Algorithmica, 12 (1994), pp. 110-147.
26. L. F. WISNIEWSKI, Efficient Design and Implementation of Permutation Algorithms on the Memory Hierarchy, Ph.D. thesis, Department of Computer Science, Dartmouth College, Hanover, NH, 1996.
27. L. F. WISNIEWSKI, Structured permuting in place on parallel disk systems, in Proceedings of the Fourth Annual Workshop on I/O in Parallel and Distributed Systems (IOPADS), ACM, New York, 1996, pp. 128-139.
28. D. WOMBLE, D. GREENBERG, S. WHEAT, AND R. RIESEN, Beyond core: Making parallel computer I/O practical, in DAGS '93, Dartmouth Institute for Advanced Graduate Studies, Hanover, NH, 1993.