The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Sz...
Abstract. We have investigated the adaptation of AI-based search techniques as topologyindependent fault-tolerant routing strategies on multiprocessor networks [9]. The results sho...
In this paper, we study fault-tolerantmulticastingin multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing ...
Jinsoo Kim, Jaehyung Park, Jung Wan Cho, Hyunsoo Y...
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
Ilwoo Chang, Matti A. Hiltunen, Richard D. Schlich...
We propose a periodic diagnostic algorithm based on the testing model of computation for real-time systems. The diagnostic task runs on every processor of the system. When the task...