Performance of a Fully Parallel Sparse Solver (1996)
| Venue: | Int. Journal of Supercomputer Applications |
| Citations: | 16 - 3 self |
BibTeX
@INPROCEEDINGS{Heath96performanceof,
author = {Michael T. Heath and Padma Raghavan},
title = {Performance of a Fully Parallel Sparse Solver},
booktitle = {Int. Journal of Supercomputer Applications},
year = {1996},
pages = {23--25},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The performance of a fully parallel direct solver for large sparse symmetric positive definite systems of linear equations is demonstrated. The solver is designed for distributed-memory, message-passing parallel computer systems. All phases of the computation, including symbolic processing as well as numeric factorization and triangular solution, are performed in parallel. A parallel Cartesian nested dissection algorithm is used to compute a fill-reducing ordering for the matrix and an appropriate partitioning of the problem across the processors. The separator This research was supported by the Advanced Research Projects Agency through the Army Research Office under contract number DAAL03-91-C-0047. y Department of Computer Science and NCSA, University of Illinois, 1304 West Springfield Ave., Urbana, IL 61801, e-mail: heath@cs.uiuc.edu. z Department of Computer Science, University of Tennessee, 107 Ayres Hall, Knoxville, TN 37996, e-mail: padma@cs.utk.edu. Parallel Sparse Sol...
