A bounded first-in, first-enabled solution to the l-exclusion problem

Yehuda Afek; Danny Dolev; Eli Gafni; Michael Merritt; Nir Shavit

doi:10.1007/3-540-54099-7_28

A bounded first-in, first-enabled solution to the l-exclusion problem

Yehuda Afek, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit

The Rachel and Selim Benin School of Engineering and Computer Science

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

7 Scopus citations

Abstract

This paper presents a solution to the first-in, first out l-exclusion problem of [FLBB79]. Unlike the solution in [FLBB79], this solution is achieved without the use of powerful read-modify-write synchronization primitives, and it requires only bounded size shared memory. Moreover, this solution has the extra property of being first-in, first-enabled, a property which subsumes first-in, first-out. Use of the concurrent time-stamp system of [DS89] is key in solving the problem within bounded size shared memory.

Original language	English
Title of host publication	Distributed Algorithms - 4th International Workshop, Proceedings
Editors	Jan van Leeuwen, Nicola Santoro
Publisher	Springer Verlag
Pages	422-431
Number of pages	10
ISBN (Print)	9783540540991
DOIs	https://doi.org/10.1007/3-540-54099-7_28
State	Published - 1991
Event	4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy Duration: 24 Sep 1990 → 26 Sep 1990

Publication series

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

Conference

Conference	4th International Workshop on Distributed Algorithms, WDAG 1990
Country/Territory	Italy
City	Bari
Period	24/09/90 → 26/09/90

Bibliographical note

Publisher Copyright:
© 1991, Springer Verlag. All rights reserved.

Access to Document

10.1007/3-540-54099-7_28

Cite this

Afek, Y., Dolev, D., Gafni, E., Merritt, M., & Shavit, N. (1991). A bounded first-in, first-enabled solution to the l-exclusion problem. In J. van Leeuwen, & N. Santoro (Eds.), Distributed Algorithms - 4th International Workshop, Proceedings (pp. 422-431). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 486 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54099-7_28

Afek, Yehuda ; Dolev, Danny ; Gafni, Eli et al. / A bounded first-in, first-enabled solution to the l-exclusion problem. Distributed Algorithms - 4th International Workshop, Proceedings. editor / Jan van Leeuwen ; Nicola Santoro. Springer Verlag, 1991. pp. 422-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{607fd924b7d841d4b34c65d6575d907d,

title = "A bounded first-in, first-enabled solution to the l-exclusion problem",

abstract = "This paper presents a solution to the first-in, first out l-exclusion problem of [FLBB79]. Unlike the solution in [FLBB79], this solution is achieved without the use of powerful read-modify-write synchronization primitives, and it requires only bounded size shared memory. Moreover, this solution has the extra property of being first-in, first-enabled, a property which subsumes first-in, first-out. Use of the concurrent time-stamp system of [DS89] is key in solving the problem within bounded size shared memory.",

author = "Yehuda Afek and Danny Dolev and Eli Gafni and Michael Merritt and Nir Shavit",

note = "Publisher Copyright: {\textcopyright} 1991, Springer Verlag. All rights reserved.; 4th International Workshop on Distributed Algorithms, WDAG 1990 ; Conference date: 24-09-1990 Through 26-09-1990",

year = "1991",

doi = "10.1007/3-540-54099-7\_28",

language = "אנגלית",

isbn = "9783540540991",

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

publisher = "Springer Verlag",

pages = "422--431",

editor = "\{van Leeuwen\}, Jan and Nicola Santoro",

booktitle = "Distributed Algorithms - 4th International Workshop, Proceedings",

address = "גרמניה",

}

Afek, Y, Dolev, D, Gafni, E, Merritt, M & Shavit, N 1991, A bounded first-in, first-enabled solution to the l-exclusion problem. in J van Leeuwen & N Santoro (eds), Distributed Algorithms - 4th International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 486 LNCS, Springer Verlag, pp. 422-431, 4th International Workshop on Distributed Algorithms, WDAG 1990, Bari, Italy, 24/09/90. https://doi.org/10.1007/3-540-54099-7_28

A bounded first-in, first-enabled solution to the l-exclusion problem. / Afek, Yehuda; Dolev, Danny; Gafni, Eli et al.
Distributed Algorithms - 4th International Workshop, Proceedings. ed. / Jan van Leeuwen; Nicola Santoro. Springer Verlag, 1991. p. 422-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 486 LNCS).

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

TY - GEN

T1 - A bounded first-in, first-enabled solution to the l-exclusion problem

AU - Afek, Yehuda

AU - Dolev, Danny

AU - Gafni, Eli

AU - Merritt, Michael

AU - Shavit, Nir

PY - 1991

Y1 - 1991

N2 - This paper presents a solution to the first-in, first out l-exclusion problem of [FLBB79]. Unlike the solution in [FLBB79], this solution is achieved without the use of powerful read-modify-write synchronization primitives, and it requires only bounded size shared memory. Moreover, this solution has the extra property of being first-in, first-enabled, a property which subsumes first-in, first-out. Use of the concurrent time-stamp system of [DS89] is key in solving the problem within bounded size shared memory.

AB - This paper presents a solution to the first-in, first out l-exclusion problem of [FLBB79]. Unlike the solution in [FLBB79], this solution is achieved without the use of powerful read-modify-write synchronization primitives, and it requires only bounded size shared memory. Moreover, this solution has the extra property of being first-in, first-enabled, a property which subsumes first-in, first-out. Use of the concurrent time-stamp system of [DS89] is key in solving the problem within bounded size shared memory.

UR - https://www.scopus.com/pages/publications/1542699079

U2 - 10.1007/3-540-54099-7_28

DO - 10.1007/3-540-54099-7_28

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

AN - SCOPUS:1542699079

SN - 9783540540991

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

SP - 422

EP - 431

BT - Distributed Algorithms - 4th International Workshop, Proceedings

A2 - van Leeuwen, Jan

A2 - Santoro, Nicola

PB - Springer Verlag

T2 - 4th International Workshop on Distributed Algorithms, WDAG 1990

Y2 - 24 September 1990 through 26 September 1990

ER -

Afek Y, Dolev D, Gafni E, Merritt M, Shavit N. A bounded first-in, first-enabled solution to the l-exclusion problem. In van Leeuwen J, Santoro N, editors, Distributed Algorithms - 4th International Workshop, Proceedings. Springer Verlag. 1991. p. 422-431. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54099-7_28

A bounded first-in, first-enabled solution to the l-exclusion problem

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this