Interactive consistency in quasi-asynchronous systems

Author

Postma, A. ; Krol, Thijs

Author_Institution

Dept. of Comput. Sci., Twente Univ., Enschede, Netherlands

fYear

1996

fDate

21-25 Oct 1996

Firstpage

2

Lastpage

9

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

Keywords

concurrency control; distributed databases; distributed processing; fault tolerant computing; software fault tolerance; consistency; deterministic interactive consistency algorithms; distributed computer system; distributed system; failures; interactive consistency; quasi-asynchronous systems; self-synchronizing ICAs; Clocks; Fault tolerance; Independent component analysis; Real time systems; Relays; Samarium; Synchronization; Uncertainty;

fLanguage

English

Publisher

ieee

Conference_Titel

Engineering of Complex Computer Systems, 1996. Proceedings., Second IEEE International Conference on

Conference_Location

Montreal, Que.

Print_ISBN

0-8186-7614-0

Type

conf

DOI

10.1109/ICECCS.1996.558564

Filename

558564