Next: About this document Up: No Title Previous: Acknowledgment

References

1
R. BUTLER AND E. LUSK. Private communication, 1991.

2
G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.

3
W. GROPP. Private communication, 1992.

4
M. T. JONES AND P. E. PLASSMANN, Scalable iterative solution of sparse linear systems, Preprint MCS-P277-1191, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., 1991.

5
height 2pt depth -1.6pt width 23pt, The effect of many-color orderings on the convergence of iterative methods, in Proceedings of the Copper Mountain Conference on Iterative Methods, Copper Mountain, Colorado, April 9-14 1992.

6
height 2pt depth -1.6pt width 23pt, Solution of large, sparse systems of linear equations in massively parallel applications, Preprint MCS-P313-0692, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., 1992.

7
height 2pt depth -1.6pt width 23pt, A parallel graph coloring heuristic, SIAM Journal on Scientific and Statistical Computing, 14 (1993).

8
V. S. SUNDERAM, PVM: A framework for parallel distributed computing, Concurrency: Practice and Experience, 2 (1990), pp. 315-339.


sgreen@cs.utk.edu