Waiting in concurrent algorithms

Gadi Taubenfeld

doi:10.1007/978-3-319-46140-3_29

Waiting in concurrent algorithms

Gadi Taubenfeld

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

Abstract

Between the two extremes, lock-based algorithms, which involve “a lot of waiting”, and wait-free algorithms, which are “free of locking and waiting”, there is an interesting spectrum of different levels of waiting. This unexplored spectrum is formally defined and its properties are investigated. New progress conditions, called k-waiting, for k ≥ 0, which are intended to capture the “amount of waiting” of processes in asynchronous concurrent algorithms, are introduced. To illustrate the utility of the new conditions, they are used to derive new lower and upper bounds, and impossibility results for well-known basic problems such as consensus, election, renaming and mutual exclusion. Furthermore, the relation between waiting and fairness is explored.

Original language	English
Title of host publication	Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers
Editors	Carole Delporte -Gallet, Parosh Aziz Abdulla
Publisher	Springer Verlag
Pages	345-360
Number of pages	16
ISBN (Print)	9783319461397
DOIs	https://doi.org/10.1007/978-3-319-46140-3_29
State	Published - 2016
Externally published	Yes
Event	4th International Conference on Networked Systems, NETYS 2016 - Marrakech, Morocco Duration: 18 May 2016 → 20 May 2016

Publication series

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

Conference

Conference	4th International Conference on Networked Systems, NETYS 2016
Country/Territory	Morocco
City	Marrakech
Period	18/05/16 → 20/05/16

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG 2016.

Keywords

Consensus
Election
Enabled process
Enabling step
K-waiting
Locks
Mutual exclusion
Renaming
Synchronization
Wait-freedom

Access to Document

10.1007/978-3-319-46140-3_29

Cite this

Taubenfeld, G. (2016). Waiting in concurrent algorithms. In C. D. -Gallet, & P. A. Abdulla (Eds.), Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers (pp. 345-360). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9944 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-46140-3_29

@inproceedings{86ef2c2da6b24487828dde4905845ce1,

title = "Waiting in concurrent algorithms",

abstract = "Between the two extremes, lock-based algorithms, which involve “a lot of waiting”, and wait-free algorithms, which are “free of locking and waiting”, there is an interesting spectrum of different levels of waiting. This unexplored spectrum is formally defined and its properties are investigated. New progress conditions, called k-waiting, for k ≥ 0, which are intended to capture the “amount of waiting” of processes in asynchronous concurrent algorithms, are introduced. To illustrate the utility of the new conditions, they are used to derive new lower and upper bounds, and impossibility results for well-known basic problems such as consensus, election, renaming and mutual exclusion. Furthermore, the relation between waiting and fairness is explored.",

keywords = "Consensus, Election, Enabled process, Enabling step, K-waiting, Locks, Mutual exclusion, Renaming, Synchronization, Wait-freedom",

author = "Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 4th International Conference on Networked Systems, NETYS 2016 ; Conference date: 18-05-2016 Through 20-05-2016",

year = "2016",

doi = "10.1007/978-3-319-46140-3_29",

language = "אנגלית",

isbn = "9783319461397",

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

publisher = "Springer Verlag",

pages = "345--360",

editor = "-Gallet, {Carole Delporte} and Abdulla, {Parosh Aziz}",

booktitle = "Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers",

address = "גרמניה",

}

Taubenfeld, G 2016, Waiting in concurrent algorithms. in CD -Gallet & PA Abdulla (eds), Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9944 LNCS, Springer Verlag, pp. 345-360, 4th International Conference on Networked Systems, NETYS 2016, Marrakech, Morocco, 18/05/16. https://doi.org/10.1007/978-3-319-46140-3_29

Waiting in concurrent algorithms. / Taubenfeld, Gadi.
Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers. ed. / Carole Delporte -Gallet; Parosh Aziz Abdulla. Springer Verlag, 2016. p. 345-360 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9944 LNCS).

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

TY - GEN

T1 - Waiting in concurrent algorithms

AU - Taubenfeld, Gadi

N1 - Publisher Copyright: © Springer International Publishing AG 2016.

PY - 2016

Y1 - 2016

N2 - Between the two extremes, lock-based algorithms, which involve “a lot of waiting”, and wait-free algorithms, which are “free of locking and waiting”, there is an interesting spectrum of different levels of waiting. This unexplored spectrum is formally defined and its properties are investigated. New progress conditions, called k-waiting, for k ≥ 0, which are intended to capture the “amount of waiting” of processes in asynchronous concurrent algorithms, are introduced. To illustrate the utility of the new conditions, they are used to derive new lower and upper bounds, and impossibility results for well-known basic problems such as consensus, election, renaming and mutual exclusion. Furthermore, the relation between waiting and fairness is explored.

AB - Between the two extremes, lock-based algorithms, which involve “a lot of waiting”, and wait-free algorithms, which are “free of locking and waiting”, there is an interesting spectrum of different levels of waiting. This unexplored spectrum is formally defined and its properties are investigated. New progress conditions, called k-waiting, for k ≥ 0, which are intended to capture the “amount of waiting” of processes in asynchronous concurrent algorithms, are introduced. To illustrate the utility of the new conditions, they are used to derive new lower and upper bounds, and impossibility results for well-known basic problems such as consensus, election, renaming and mutual exclusion. Furthermore, the relation between waiting and fairness is explored.

KW - Consensus

KW - Election

KW - Enabled process

KW - Enabling step

KW - K-waiting

KW - Locks

KW - Mutual exclusion

KW - Renaming

KW - Synchronization

KW - Wait-freedom

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

U2 - 10.1007/978-3-319-46140-3_29

DO - 10.1007/978-3-319-46140-3_29

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

AN - SCOPUS:84990058625

SN - 9783319461397

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

SP - 345

EP - 360

BT - Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers

A2 - -Gallet, Carole Delporte

A2 - Abdulla, Parosh Aziz

PB - Springer Verlag

T2 - 4th International Conference on Networked Systems, NETYS 2016

Y2 - 18 May 2016 through 20 May 2016

ER -

Taubenfeld G. Waiting in concurrent algorithms. In -Gallet CD, Abdulla PA, editors, Networked Systems - 4th International Conference, NETYS 2016, Revised Selected Papers. Springer Verlag. 2016. p. 345-360. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-46140-3_29

Waiting in concurrent algorithms

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this