Distance agreement protocols

Author

Echtle, K.

Author_Institution

Karlsruhe Univ., West Germany

fYear

1989

fDate

21-23 June 1989

Firstpage

191

Lastpage

198

Abstract

A novel class of agreement protocols suitable for replicated nondeterministic processes is introduced. Reduction of message number and early stopping are achieved by taking distance decisions not after, but during protocol execution. Metrical comparison of results is not restricted to numerical applications. Unlike median selection, it covers multidimensional spaces and helps to solve typical problems of distributed systems, e.g., global scheduling, synchronization, sequence agreement, reconfiguration, and elimination of time skew. A so-called pendulum protocol is described in detail.<>

Keywords

distributed processing; fault tolerant computing; protocols; redundancy; scheduling; synchronisation; agreement protocols; distance decisions; early stopping; fault marking; global scheduling; modular redundancy; numerical applications; pendulum protocol; protocol execution; reconfiguration; replicated nondeterministic processes; sequence agreement; signature; synchronization; time skew elimination; Application software; Authentication; Digital signatures; Fault tolerance; Gunn devices; Intelligent networks; Protocols; Redundancy; Runtime; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Fault-Tolerant Computing, 1989. FTCS-19. Digest of Papers., Nineteenth International Symposium on

Conference_Location

Chicago, IL, USA

Print_ISBN

0-8186-1959-7

Type

conf

DOI

10.1109/FTCS.1989.105565

Filename

105565