Structured derivation of semi-synchronous algorithms

Hagit Attiya; Fatemeh Borran; Martin Hutle; Zarko Milosevic; André Schiper

doi:10.1007/978-3-642-24100-0_37

Structured derivation of semi-synchronous algorithms

Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, André Schiper

Computer Science

Technion - Israel Institute of Technology

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

Abstract

The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive, Timely Announced Broadcast (TAB), and uses it in algorithms for consensus and set consensus in the semi-synchronous model. Separate implementations of TAB, withstanding different types of failures, allow to derive algorithms for consensus and set consensus under crash and omission failures. The time bounds obtained by our algorithms asymptotically match, or improve, the previously known bounds.

Original language	English
Title of host publication	Distributed Computing - 25th International Symposium, DISC 2011, Proceedings
Pages	374-388
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-24100-0_37
State	Published - 2011
Event	25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy Duration: 20 Sep 2011 → 22 Sep 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6950 LNCS

Conference

Conference	25th International Symposium on Distributed Computing, DISC 2011
Country/Territory	Italy
City	Rome
Period	20/09/11 → 22/09/11

Keywords

semi-synchronous systems
set consensus
terminating reliable broadcast
timely announced broadcast

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-24100-0_37

Cite this

Attiya, H., Borran, F., Hutle, M., Milosevic, Z., & Schiper, A. (2011). Structured derivation of semi-synchronous algorithms. In Distributed Computing - 25th International Symposium, DISC 2011, Proceedings (pp. 374-388). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6950 LNCS). https://doi.org/10.1007/978-3-642-24100-0_37

@inproceedings{2efd96150f9445a9bc12f0072ca3923c,

title = "Structured derivation of semi-synchronous algorithms",

abstract = "The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive, Timely Announced Broadcast (TAB), and uses it in algorithms for consensus and set consensus in the semi-synchronous model. Separate implementations of TAB, withstanding different types of failures, allow to derive algorithms for consensus and set consensus under crash and omission failures. The time bounds obtained by our algorithms asymptotically match, or improve, the previously known bounds.",

keywords = "semi-synchronous systems, set consensus, terminating reliable broadcast, timely announced broadcast",

author = "Hagit Attiya and Fatemeh Borran and Martin Hutle and Zarko Milosevic and Andr{\'e} Schiper",

year = "2011",

doi = "10.1007/978-3-642-24100-0_37",

language = "الإنجليزيّة",

isbn = "9783642240997",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "374--388",

booktitle = "Distributed Computing - 25th International Symposium, DISC 2011, Proceedings",

note = "25th International Symposium on Distributed Computing, DISC 2011 ; Conference date: 20-09-2011 Through 22-09-2011",

}

Attiya, H, Borran, F, Hutle, M, Milosevic, Z & Schiper, A 2011, Structured derivation of semi-synchronous algorithms. in Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6950 LNCS, pp. 374-388, 25th International Symposium on Distributed Computing, DISC 2011, Rome, Italy, 20/09/11. https://doi.org/10.1007/978-3-642-24100-0_37

Structured derivation of semi-synchronous algorithms. / Attiya, Hagit; Borran, Fatemeh; Hutle, Martin et al.
Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. 2011. p. 374-388 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6950 LNCS).

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

TY - GEN

T1 - Structured derivation of semi-synchronous algorithms

AU - Attiya, Hagit

AU - Borran, Fatemeh

AU - Hutle, Martin

AU - Milosevic, Zarko

AU - Schiper, André

PY - 2011

Y1 - 2011

N2 - The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive, Timely Announced Broadcast (TAB), and uses it in algorithms for consensus and set consensus in the semi-synchronous model. Separate implementations of TAB, withstanding different types of failures, allow to derive algorithms for consensus and set consensus under crash and omission failures. The time bounds obtained by our algorithms asymptotically match, or improve, the previously known bounds.

AB - The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive, Timely Announced Broadcast (TAB), and uses it in algorithms for consensus and set consensus in the semi-synchronous model. Separate implementations of TAB, withstanding different types of failures, allow to derive algorithms for consensus and set consensus under crash and omission failures. The time bounds obtained by our algorithms asymptotically match, or improve, the previously known bounds.

KW - semi-synchronous systems

KW - set consensus

KW - terminating reliable broadcast

KW - timely announced broadcast

UR - http://www.scopus.com/inward/record.url?scp=80055060001&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24100-0_37

DO - 10.1007/978-3-642-24100-0_37

M3 - منشور من مؤتمر

SN - 9783642240997

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 374

EP - 388

BT - Distributed Computing - 25th International Symposium, DISC 2011, Proceedings

T2 - 25th International Symposium on Distributed Computing, DISC 2011

Y2 - 20 September 2011 through 22 September 2011

ER -

Attiya H, Borran F, Hutle M, Milosevic Z, Schiper A. Structured derivation of semi-synchronous algorithms. In Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. 2011. p. 374-388. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-24100-0_37

Structured derivation of semi-synchronous algorithms

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this