Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H, construct a graph G from H by adding a minimum number D(t, H) of edges such that even after deleting any t edges from G the remaini
β¦ LIBER β¦
Fault tolerance for Technovision users
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 467 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Fault-tolerant graphs for tori
β
Yamada, Toshinori; Ueno, Shuichi
π
Article
π
1998
π
John Wiley and Sons
π
English
β 118 KB
π 2 views
Fault tolerance for data parallel progra
β
C. Bertolli; M. Vanneschi
π
Article
π
2010
π
John Wiley and Sons
π
English
β 837 KB
## Abstract The main issues when supporting fault tolerance based on checkpointing and rollback recovery for HighβPerformance applications are related to the scalability of the introduced support, the possibility of analyzing the induced overhead and, in more general terms, the optimization of the
Fault tolerance increasingly important f
β
Esther H. Highland
π
Article
π
1988
π
Elsevier Science
π
English
β 111 KB
Fault tolerance for highly parallel comp
β
M. Dal Cin
π
Article
π
1991
π
Elsevier Science
β 405 KB
Optimal replacement for fault-tolerant s
β
Howard M. Taylor; Beatriz E. Rodriguez
π
Article
π
1986
π
John Wiley and Sons
π
English
β 531 KB
We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distinguishable, and the state of the system is given by knowing exactly which components are operational and which have failed. The individual component failure rates depend on the
Fault-tolerant architectures for tree LA
β
D Saha; P Dhar
π
Article
π
1991
π
Elsevier Science
π
English
β 403 KB