Sciweavers

264 search results - page 20 / 53
» Bounding the number of tolerable faults in majority-based sy...
Sort
View
SSS
2005
Springer
119views Control Systems» more  SSS 2005»
15 years 2 months ago
Self-stabilization of Byzantine Protocols
Awareness of the need for robustness in distributed systems increases as distributed systems become integral parts of day-to-day systems. Self-stabilizing while tolerating ongoing ...
Ariel Daliot, Danny Dolev
IPPS
2003
IEEE
15 years 2 months ago
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distrib...
Kamilla Klonowska, Lars Lundberg, Håkan Lenn...
PPOPP
2005
ACM
15 years 3 months ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
IPPS
2006
IEEE
15 years 3 months ago
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
Vandy Berten, Joël Goossens, Emmanuel Jeannot
ICFEM
2009
Springer
15 years 4 months ago
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
Péter Bokor, Marco Serafini, Neeraj Suri, H...