A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem

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

doi:10.1145/177492.177731

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: Contribution to journal › Article › peer-review

33 Scopus citations

Abstract

This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory.

Original language	English
Pages (from-to)	939-953
Number of pages	15
Journal	ACM Transactions on Programming Languages and Systems
Volume	16
Issue number	3
DOIs	https://doi.org/10.1145/177492.177731
State	Published - 5 Jan 1994

Keywords

atomic registers
concurrency
timestamps

Access to Document

10.1145/177492.177731

Cite this

@article{8a5b65a5369c466f8e2d84a58d388d6d,

title = "A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem",

abstract = "This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory.",

keywords = "atomic registers, concurrency, timestamps",

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

year = "1994",

month = jan,

day = "5",

doi = "10.1145/177492.177731",

language = "אנגלית",

volume = "16",

pages = "939--953",

journal = "ACM Transactions on Programming Languages and Systems",

issn = "0164-0925",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

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 - 1994/1/5

Y1 - 1994/1/5

N2 - This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory.

AB - This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory.

KW - atomic registers

KW - concurrency

KW - timestamps

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

U2 - 10.1145/177492.177731

DO - 10.1145/177492.177731

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0028429290

SN - 0164-0925

VL - 16

SP - 939

EP - 953

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

IS - 3

ER -

A Bounded First-in, First-Enabled Solution to the l-Exclusion Problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this