Time vs. Space in Fault-Tolerant Distributed Systems

Algorithms for solving agreement problems can be classified in two categories: (1) those relying on failure detectors that we call \emph{FD-based}, and (2) those that rely on a Group Membership Service that we call ``GMS-based''. The paper discusses the advantages and limitations of these two approaches, and proposes an extension to the GMS-approach that combines the advantages of both approaches, without their drawbacks. This extension leads us to distinguish between ``time-triggered'' suspicions of processes and ``space-triggered'' exclusions.


Published in:
Proceedings of the 6th IEEE International Workshop on Object-oriented Real-time Dependable Systems (WORDS'01)
Year:
2001
Publisher:
IEEE Computer Society
Laboratories:




 Record created 2005-05-20, last modified 2018-03-17

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)