Abstract
Two graceful degradation schemes for two-dimensional wavefront arrays are discussed. The first scheme is the static dataflow scheme which can be applied to both run-time and compile-time applications. The second scheme is the dynamic dataflow scheme which is mainly used for run-time applications. For the static scheme, topics discussed include program complexity and load balancing. For the dynamic scheme, the focus is on routing control. Without broadcasting, a distributed faulty pattern is developed. An upper-bound analysis of the system survival probability for both schemes is presented. Results of Monte Carlo simulations for both schemes are compared, and the tradeoff between fault-tolerant capability and hardware complexity is explored.
Original language | English (US) |
---|---|
Pages (from-to) | 249-255 |
Number of pages | 7 |
Journal | Proceedings of the International Conference on Parallel Processing |
Volume | 1 |
State | Published - 1988 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture