On fault tolerant matrix decomposition
✍ Scribed by Fitzpatrick, Patrick
- Publisher
- Springer
- Year
- 1994
- Tongue
- English
- Weight
- 744 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0922-5773
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Multicast (one-to-many) communication has important applications in parallel architecture and communication networks. This paper considers the multicast problem for a \(d\) dimensional binary hypercube in the presence of \(F\) link failures, where \(F<d\). We develop a fault-tolerant (FT) multicast
An approach to design fault-tolerant hexagonal systolic array (SA) for multiplication of rectangular matrices is described. The approach comprises three steps. First, redundancies are introduced at the computational level by deriving three equivalent algorithms but with disjoint index spaces. Second
Networks of workstations (NOWs) offer a cost-effective platform for high-performance, long-running parallel computations. However, these computations must be able to tolerate the changing and often faulty nature of NOW environments. We present high-performance implementations of several fault-tolera