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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationDistributed Algorithms - 4th International Workshop, Proceedings
EditorsJan van Leeuwen, Nicola Santoro
PublisherSpringer Verlag
Pages422-431
Number of pages10
ISBN (Print)9783540540991
DOIs
StatePublished - 1991
Event4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy
Duration: 24 Sep 199026 Sep 1990

Publication series

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

Conference

Conference4th International Workshop on Distributed Algorithms, WDAG 1990
Country/TerritoryItaly
CityBari
Period24/09/9026/09/90

Funding

FundersFunder number
AT&T Bell Laboratories
XEROX Co.W881111
National Science FoundationDCR84-51396
University of California

    Fingerprint

    Dive into the research topics of 'A bounded first-in, first-enabled solution to the l-exclusion problem'. Together they form a unique fingerprint.

    Cite this