Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 332-344

  Leiserson, Charles E ^a   Rao, Satish ^b   Toledo, Sivan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER); VECTORS;

BLOCKING COVERS; LINEAR RELAXATION;

ALGORITHMS;

EID: 0031122907     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1473     Document Type: Article

References (12)

1. A. Aggarwal and J. S. Vitter, The input/output complexity of sorting and related problems, Comm. ACM 31, No. 9 (1988), 1116-1127.
2. B. Awerbuch and D. Peleg, Sparse partitions, in "31 st Symposium on Foundations of Computer Science, 1990," pp. 503-513.
3. W. L. Briggs, "A Multigrid Tutorial," SIAM, Philadelphia, 1987.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, McGraw-Hill, New York, 1990.
5. J.-W. Hong and H. T. Kung, I/O complexity: The red-blue pebble game, in "Proceedings, 13th Annual ACM Symposium on Theory of Computing, 1981," pp. 326-333.
6. C. Kaklamanis, D. Krizanc, and S. Rao, New graph decompositions and fast emulations in hypercubes and butterflies, in "Proceedings, 5th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1993," pp. 325-334.
7. R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg, Work-preserving emulations of fixed-connection networks, in "Proceedings, 21st Annual ACM Symposium on Theory of Computing, May 1989," pp. 227-240.
8. C. E. Leiserson, S. Rao, and S. Toledo, Efficient out-of-core algorithms for linear relaxation using blocking covers, in "34rd Annual Symposium on Foundations of Computer Science, November 1993," pp. 704-713.
9. G. Miller and W. Thurston, Separators in two and three dimensions, in "Proceedings, 22nd Annual ACM Symposium on Theory of Computing, May 1990," pp. 300-309.
10. G. L. Miller, S.-H. Teng, and S. A. Vavasis, A unified geometric approach to graph separators, in "Proceedings, 32nd Annual Symposium on Foundations of Computer Science, 1991," pp. 538-547.
11. C. J. Pfeifer, Data flow and storage allocation for the PDQ-5 program on the Philco-2000, Comm. ACM 6, No. 7 (1963), 365-366.
12. S. Plotkin, S. Rao, and W. Smith, Shallow excluded minors and improved graph decomposition, in "Proceedings, 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994," pp. 462-470.