A bounded first-in, first-enabled solution to the l-exclusion problem
- Cite this paper as:
- Afek Y., Dolev D., Gafni E., Merritt M., Shavit N. (1991) A bounded first-in, first-enabled solution to the l-exclusion problem. In: van Leeuwen J., Santoro N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg
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 readmodify-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.
Unable to display preview. Download preview PDF.