Computing with infinitely many processes: Under assumptions on concurrency and participation

Michael Merritt; Gadi Taubenfeld

doi:10.1007/3-540-40026-5_11

Computing with infinitely many processes: Under assumptions on concurrency and participation

Michael Merritt, Gadi Taubenfeld

Computer Science discipline

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

Abstract

We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for starvation-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as testandset bits, semaphores or read-modify- write registers, are used.

Original language	English
Title of host publication	Distributed Computing-14th InternationalConference, DISC 2000, Proceedings
Editors	Maurice Herlihy
Publisher	Springer Verlag
Pages	164-178
Number of pages	15
ISBN (Print)	3540411437
DOIs	https://doi.org/10.1007/3-540-40026-5_11
State	Published - 2000
Event	14th International Conference on Distributed Computing, DISC 2000 - Toledo, Spain Duration: 4 Oct 2000 → 6 Oct 2000

Publication series

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

Conference

Conference	14th International Conference on Distributed Computing, DISC 2000
Country/Territory	Spain
City	Toledo
Period	4/10/00 → 6/10/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Access to Document

10.1007/3-540-40026-5_11

Cite this

Merritt, M., & Taubenfeld, G. (2000). Computing with infinitely many processes: Under assumptions on concurrency and participation. In M. Herlihy (Ed.), Distributed Computing-14th InternationalConference, DISC 2000, Proceedings (pp. 164-178). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1914). Springer Verlag. https://doi.org/10.1007/3-540-40026-5_11

Merritt, Michael ; Taubenfeld, Gadi. / Computing with infinitely many processes : Under assumptions on concurrency and participation. Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. editor / Maurice Herlihy. Springer Verlag, 2000. pp. 164-178 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{114619a2416146868e88575b89515182,

title = "Computing with infinitely many processes: Under assumptions on concurrency and participation",

abstract = "We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for starvation-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as testandset bits, semaphores or read-modify- write registers, are used.",

author = "Michael Merritt and Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 14th International Conference on Distributed Computing, DISC 2000 ; Conference date: 04-10-2000 Through 06-10-2000",

year = "2000",

doi = "10.1007/3-540-40026-5_11",

language = "אנגלית",

isbn = "3540411437",

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

publisher = "Springer Verlag",

pages = "164--178",

editor = "Maurice Herlihy",

booktitle = "Distributed Computing-14th InternationalConference, DISC 2000, Proceedings",

address = "גרמניה",

}

Merritt, M & Taubenfeld, G 2000, Computing with infinitely many processes: Under assumptions on concurrency and participation. in M Herlihy (ed.), Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1914, Springer Verlag, pp. 164-178, 14th International Conference on Distributed Computing, DISC 2000, Toledo, Spain, 4/10/00. https://doi.org/10.1007/3-540-40026-5_11

Computing with infinitely many processes: Under assumptions on concurrency and participation. / Merritt, Michael; Taubenfeld, Gadi.
Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. ed. / Maurice Herlihy. Springer Verlag, 2000. p. 164-178 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1914).

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

TY - GEN

T1 - Computing with infinitely many processes

T2 - 14th International Conference on Distributed Computing, DISC 2000

AU - Merritt, Michael

AU - Taubenfeld, Gadi

PY - 2000

Y1 - 2000

N2 - We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for starvation-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as testandset bits, semaphores or read-modify- write registers, are used.

AB - We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for starvation-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as testandset bits, semaphores or read-modify- write registers, are used.

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

U2 - 10.1007/3-540-40026-5_11

DO - 10.1007/3-540-40026-5_11

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

AN - SCOPUS:34547538473

SN - 3540411437

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

SP - 164

EP - 178

BT - Distributed Computing-14th InternationalConference, DISC 2000, Proceedings

A2 - Herlihy, Maurice

PB - Springer Verlag

Y2 - 4 October 2000 through 6 October 2000

ER -

Merritt M, Taubenfeld G. Computing with infinitely many processes: Under assumptions on concurrency and participation. In Herlihy M, editor, Distributed Computing-14th InternationalConference, DISC 2000, Proceedings. Springer Verlag. 2000. p. 164-178. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-40026-5_11

Computing with infinitely many processes: Under assumptions on concurrency and participation

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this