Interactive Consistency in Quasi-Asynchronous Systems

A. Postma; Th. Krol

doi:10.1109/ICECCS.1996.558564

Interactive Consistency in Quasi-Asynchronous Systems

A. Postma, Th. Krol

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

111 Downloads (Pure)

Abstract

In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to satisfy this requirement. Therefore, in this paper, we describe a new class of self-synchronizing ICAs that guarantee interactive consistency without the above-mentioned requirement

Original language	English
Title of host publication	Proceedings 2nd IEEE International Conference on Engineering of Complex Computer Systems
Place of Publication	Montreal, Canada
Publisher	IEEE
Pages	2-9
ISBN (Print)	0-8186-7614-0
DOIs	https://doi.org/10.1109/ICECCS.1996.558564
Publication status	Published - 31 Jan 1996
Event	2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996 - Montreal, Canada Duration: 21 Oct 1996 → 25 Oct 1996 Conference number: 2

Publication series

Name
Publisher	IEEE

Conference

Conference	2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996
Abbreviated title	ICECCS
Country/Territory	Canada
City	Montreal
Period	21/10/96 → 25/10/96

Access to Document

10.1109/ICECCS.1996.558564

Postma1996interactiveFinal published version, 986 KB

2 Citations
1 Report

Interactive Consistency in Quasi-Asynchronous Systems
Postma, A. & Krol, T., 1996, Enschede: University of Twente. 10 p. (Memoranda informatica; no. 96-05)
Research output: Book/Report › Report › Academic

Cite this

@inproceedings{4a85d10b119d4b92a1ec10724def4e55,

title = "Interactive Consistency in Quasi-Asynchronous Systems",

abstract = "In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to satisfy this requirement. Therefore, in this paper, we describe a new class of self-synchronizing ICAs that guarantee interactive consistency without the above-mentioned requirement",

author = "A. Postma and Th. Krol",

year = "1996",

month = jan,

day = "31",

doi = "10.1109/ICECCS.1996.558564",

language = "English",

isbn = "0-8186-7614-0",

publisher = "IEEE",

pages = "2--9",

booktitle = "Proceedings 2nd IEEE International Conference on Engineering of Complex Computer Systems",

address = "United States",

note = "2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996, ICECCS ; Conference date: 21-10-1996 Through 25-10-1996",

}

Postma, A & Krol, T 1996, Interactive Consistency in Quasi-Asynchronous Systems. in Proceedings 2nd IEEE International Conference on Engineering of Complex Computer Systems. IEEE, Montreal, Canada, pp. 2-9, 2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996, Montreal, Quebec, Canada, 21/10/96. https://doi.org/10.1109/ICECCS.1996.558564

TY - GEN

T1 - Interactive Consistency in Quasi-Asynchronous Systems

AU - Postma, A.

AU - Krol, Th.

N1 - Conference code: 2

PY - 1996/1/31

Y1 - 1996/1/31

N2 - In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to satisfy this requirement. Therefore, in this paper, we describe a new class of self-synchronizing ICAs that guarantee interactive consistency without the above-mentioned requirement

AB - In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to satisfy this requirement. Therefore, in this paper, we describe a new class of self-synchronizing ICAs that guarantee interactive consistency without the above-mentioned requirement

U2 - 10.1109/ICECCS.1996.558564

DO - 10.1109/ICECCS.1996.558564

M3 - Conference contribution

SN - 0-8186-7614-0

SP - 2

EP - 9

BT - Proceedings 2nd IEEE International Conference on Engineering of Complex Computer Systems

PB - IEEE

CY - Montreal, Canada

T2 - 2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996

Y2 - 21 October 1996 through 25 October 1996

ER -

Interactive Consistency in Quasi-Asynchronous Systems

Abstract

Publication series

Conference

Access to Document

Fingerprint

Research output

Interactive Consistency in Quasi-Asynchronous Systems

Cite this