Referenced Items are not available for this document.
Algorithms for solving agreement problems can be classified in two categories: (1) those relying on failure detectors (FDs), which we call FD-based, and (2) those that rely on a group membership service (GMS), which we call GMS-based. This 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:
Object-Oriented Real-Time Dependable Systems, 2001. Proceedings. Sixth International Workshop on
Date of Conference: 2001
- Page(s):
- 21 - 27
- Meeting Date :
- 08 Jan 2001-10 Jan 2001
- ISSN :
- 1530-1443
- Print ISBN:
- 0-7695-1068-X
- INSPEC Accession Number:
- 7068400
- Conference Location :
- Rome
- Digital Object Identifier :
- 10.1109/WORDS.2001.945109
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
