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
N1 - Publisher Copyright:
© 1991, Springer Verlag. All rights reserved.
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 - http://www.scopus.com/inward/record.url?scp=1542699079&partnerID=8YFLogxK
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 -