K. Eswar, C.-H. Huang, and P. Sadayappan, "On mapping data and computation for parallel sparse Cholesky factorization," Department of Computer and Information Science, The Ohio State University, Technical Report No. OSU-CISRC-7/94-TR40, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
HPF-2 Scope of Activities and Motivating Applications - Forum (1994) (3 citations) (Correct)
....the parallel factorization. Two members of this class of algorithms are the block fan out algorithm [81] and a parallel multifrontal algorithm presented in [48] A discussion of the issues to be addressed in mapping the data and the computation of sparse Cholesky factorization may be found in [33]. Whatever the level of granularity used, the essential problem with expressing this computation using HPF is the presence of nested doacross loops, where the dependences are determined by the sparsity structure of the matrix. The canonical and baseline versions of the application provided use ....
K. Eswar, C.-H. Huang, and P. Sadayappan. On mapping data and computation for parallel sparse cholesky factorization. Technical Report OSU-CISRC-7/94-TR40, Department of Computer and Information Science, The Ohio State University, 1994.
On Mapping Data and Computation for Parallel Sparse.. - Eswar, Huang, Sadayappan (1994) (1 citation) Self-citation (Eswar Huang Sadayappan) (Correct)
No context found.
K. Eswar, C.-H. Huang, and P. Sadayappan, "On mapping data and computation for parallel sparse Cholesky factorization," Department of Computer and Information Science, The Ohio State University, Technical Report No. OSU-CISRC-7/94-TR40, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC