Time vs. space in fault-tolerant distributed systems

B. Charron-Bost; X. Défago; A. Schiper

doi:10.1109/WORDS.2001.945109

Time vs. space in fault-tolerant distributed systems

B. Charron-Bost
, X. Défago
, A. Schiper

École Polytechnique

Laboratoire d'Informatique (LIX)

Research output: Contribution to conference › Paper › peer-review

Abstract

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.

Original language	English
Pages	21-27
Number of pages	7
DOIs	https://doi.org/10.1109/WORDS.2001.945109
Publication status	Published - 1 Jan 2001
Event	6th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS) - Rome, Italy Duration: 8 Jan 2001 → 10 Jan 2001

Conference

Conference	6th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS)
Country/Territory	Italy
City	Rome
Period	8/01/01 → 10/01/01

Access to Document

10.1109/WORDS.2001.945109

Cite this

@conference{fa47af2b17f44e409bd7a223d7b9d12b,

title = "Time vs. space in fault-tolerant distributed systems",

abstract = "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.",

author = "B. Charron-Bost and X. D{\'e}fago and A. Schiper",

year = "2001",

month = jan,

day = "1",

doi = "10.1109/WORDS.2001.945109",

language = "English",

pages = "21--27",

note = "6th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS) ; Conference date: 08-01-2001 Through 10-01-2001",

}

TY - CONF

T1 - Time vs. space in fault-tolerant distributed systems

AU - Charron-Bost, B.

AU - Défago, X.

AU - Schiper, A.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0034832645

U2 - 10.1109/WORDS.2001.945109

DO - 10.1109/WORDS.2001.945109

M3 - Paper

AN - SCOPUS:0034832645

SP - 21

EP - 27

T2 - 6th International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS)

Y2 - 8 January 2001 through 10 January 2001

ER -

Time vs. space in fault-tolerant distributed systems

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this