Scotch Brand 5.1.10 - Manual (Page 136)

[44] F. Pellegrini and J. Roman. Experimental analysis of the dual recursive bipar-
titioning algorithm for static mapping. Research Report, LaBRI, Universit´e
Bordeaux I, August 1996. Available from http://www.labri.fr/~pelegrin/
papers/scotch_expanalysis.ps.gz
.
[45] F. Pellegrini and J. Roman. Scotch: A software package for static mapping
by dual recursive bipartitioning of process and architecture graphs. In Proc.
HPCN’96, Brussels
, LNCS 1067, pages 493–498, April 1996.
[46] F. Pellegrini and J. Roman. Sparse matrix ordering with scotch. In Proc.
HPCN’97, Vienna , LNCS 1225, pages 370–378, April 1997.
[47] F. Pellegrini, J. Roman, and P. Amestoy. Hybridizing nested dissection and
halo approximate minimum degree for efficient sparse matrix ordering. In Proc.
Irregular’99, San Juan
, LNCS 1586, pages 986–995, April 1999.
[48] A. Pothen and C.-J. Fan. Computing the block triangular form of a sparse
matrix. ACM Trans. Math. Software, 16(4):303–324, December 1990.
[49] A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with
eigenvectors of graphs. SIAM Journal of Matrix Analysis, 11(3):430–452, July
1990.
[50] E. Rothberg. Performance of panel and block approaches to sparse Cholesky
factorization on the iPSC/860 and Paragon multicomputers. In Proc. SH-
PCC’94, Knoxville
, pages 324–333. IEEE, May 1994.
[51] E. Rothberg and A. Gupta. An efficient block-oriented approach to parallel
sparse Cholesky factorization. In Supercomputing’93 Proceedings. IEEE, 1993.
[52] E. Rothberg and R. Schreiber. Improved load distribution in parallel sparse
Cholesky factorization. In Supercomputing’94 Proceedings. IEEE, 1994.
[53] R. Schreiber. Scalability of sparse direct solvers. Technical Report TR 92.13,
RIACS, NASA Ames Research Center, May 1992.
[54] H. D. Simon. Partitioning of unstructured problems for parallel processing.
Computing Systems in Engineering , 2:135–148, 1991.
[55] W. F. Tinney and J. W. Walker. Direct solutions of sparse network equations
by optimally ordered triangular factorization. J. Proc. IEEE, 55:1801–1809,
1967.
[56] C. Walshaw, M. Cross, M. G. Everett, S. Johnson, and K. McManus. Parti-
tioning & mapping of unstructured meshes to parallel machine topologies. In
Proc. Irregular’95
, number 980 in LNCS, pages 121–126, 1995.
136