Sixth International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'01) Time vs. Space in Fault-Tolerant Distributed Systems Rome, Italy January 08-January 10 ISBN: 0-7695-1068-X
Algorithms for solving agreement problems can be classified in two categories:(1)those relying on failure detectors that we call 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.
Citation:
Bernadette Charron-Bost, Xavier Defago, Andre Schiper, "Time vs. Space in Fault-Tolerant Distributed Systems," words, pp.21, Sixth International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'01), 2001 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||