A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers

@inproceedings{Karypis1994AHP,
  title={A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers},
  author={George Karypis and Vipin Kumar},
  year={1994}
}
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently introduced scheme by Gupta and Kumar [13]. Asymptotically, both formulations are equally scalable on a wide range of architectures and a wide variety of problems. But the subtree-to-subcube mapping of the earlier formulation causes signi cant load imbalance among processors, limiting overall e ciency and… CONTINUE READING
9 Citations
39 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Ordering and load balancing for parallel factorization of sparse matrices

  • George Karypis, Anshul Gupta, Vipin Kumar
  • Technical Report (in preparation),
  • 1994
5 Excerpts

E cient parallel solutions of large sparse SPD systems on distributed-memory multiprocessors

  • Chunguang Sun
  • Technical report,
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…