Deadlock-free Asynchronous Communication Strategies for Unstructured Computations on iPSC/860

Authors:
Sesh Venugopal;Vijay K. Naik
Affiliations:
Rutgers University, USA;IBM T.J. Watson Research Center, USA
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Year:
1994

Citing 3
Cited 0

Sparse matrix test problems

ACM Transactions on Mathematical Software (TOMS)
Performance of distributed sparse Cholesky factorization with pre-scheduling

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Parallelizing unstructured sparse matrix computations on large-scale multiprocessors

Parallelizing unstructured sparse matrix computations on large-scale multiprocessors

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe efficient, scalable, and deadlock-free asynchronous communication strategies suitable for unstructured computations on iPSC/860. Using these deadlock-free strategies, which incur small overhead, we have optimized the communication in parallel sparse Cholesky factorization. We present experimental results to show that such optimizations can lead to more than 50% saving in communication costs.