Abstract
Array algorithms for matrix computations have been proposed in the past. These algorithms are vulnerable to failures in the processors and communication links. We propose algorithms for some parallel matrix computations that will execute on any connected set of processors with no a priori topological restrictions. The connected set of processors could form the non-faulty processors in an underlying network that has both faulty and non-faulty processors and links.
| Original language | English |
|---|---|
| Pages | 268-272 |
| Number of pages | 5 |
| State | Published - 1984 |
Fingerprint
Dive into the research topics of 'SYNTHESIS OF FAULT-TOLERANT PARALLEL MATRIX COMPUTATIONS.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver