The computational structure of progress conditions

Gadi Taubenfeld

doi:10.1007/978-3-642-15763-9_23

The computational structure of progress conditions

Gadi Taubenfeld

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

Abstract

Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.

Original language	English
Title of host publication	Distributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages	221-235
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-15763-9_23
State	Published - 2010
Externally published	Yes
Event	24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States Duration: 13 Sep 2010 → 15 Sep 2010

Publication series

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

Conference

Conference	24th International Symposium on Distributed Computing, DISC 2010
Country/Territory	United States
City	Cambridge, MA
Period	13/09/10 → 15/09/10

Keywords

Progress conditions
S-freedom
consensus
contention
cooperation
hierarchy
obstruction-freedom
synchronization
universality
wait-freedom

Access to Document

10.1007/978-3-642-15763-9_23

Cite this

@inproceedings{edcd1b8b80ec4be682cb84b85a08be0b,

title = "The computational structure of progress conditions",

abstract = "Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.",

keywords = "Progress conditions, S-freedom, consensus, contention, cooperation, hierarchy, obstruction-freedom, synchronization, universality, wait-freedom",

author = "Gadi Taubenfeld",

year = "2010",

doi = "10.1007/978-3-642-15763-9_23",

language = "אנגלית",

isbn = "3642157629",

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

pages = "221--235",

booktitle = "Distributed Computing - 24th International Symposium, DISC 2010, Proceedings",

}

Taubenfeld, G 2010, The computational structure of progress conditions. in Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6343 LNCS, pp. 221-235, 24th International Symposium on Distributed Computing, DISC 2010, Cambridge, MA, United States, 13/09/10. https://doi.org/10.1007/978-3-642-15763-9_23

The computational structure of progress conditions. / Taubenfeld, Gadi.
Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. p. 221-235 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS).

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

TY - GEN

T1 - The computational structure of progress conditions

AU - Taubenfeld, Gadi

PY - 2010

Y1 - 2010

N2 - Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.

AB - Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.

KW - Progress conditions

KW - S-freedom

KW - consensus

KW - contention

KW - cooperation

KW - hierarchy

KW - obstruction-freedom

KW - synchronization

KW - universality

KW - wait-freedom

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

U2 - 10.1007/978-3-642-15763-9_23

DO - 10.1007/978-3-642-15763-9_23

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78649902390

SN - 3642157629

SN - 9783642157622

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

SP - 221

EP - 235

BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings

T2 - 24th International Symposium on Distributed Computing, DISC 2010

Y2 - 13 September 2010 through 15 September 2010

ER -

The computational structure of progress conditions

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this