An optimal self-stabilizing firing squad

Danny Dolev*, Ezra N. Hoch, Yoram Moses

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of eventually guaranteeing simultaneous response to an external input. This is modeled by requiring that the non-crashed processes fire simultaneously if some correct process received an external go input, and that they only fire as a response to some process receiving such an input. This paper presents Fire-Squad, the first self-stabilizing firing squad algorithm. The Fire-Squad algorithm is optimal in two respects: (a) Once the algorithm is in a safe state, it fires in response to a go input as fast as any other algorithm does, and (b) Starting from an arbitrary state, it converges to a safe state as fast as any other algorithm does.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 11th International Symposium, SSS 2009, Proceedings
Pages284-296
Number of pages13
DOIs
StatePublished - 2009
Event11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009 - Lyon, France
Duration: 3 Nov 20096 Nov 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5873 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009
Country/TerritoryFrance
CityLyon
Period3/11/096/11/09

Fingerprint

Dive into the research topics of 'An optimal self-stabilizing firing squad'. Together they form a unique fingerprint.

Cite this