Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Bounded FirstIn, FirstEnabled Solution to the `Exclusion Problem
 

Summary: A Bounded First­In, First­Enabled Solution to the
`­Exclusion Problem
Yehuda Afek
AT&T Bell Laboratories and Tel­Aviv University
and
Danny Dolev
IBM Almaden Research Center and Hebrew University
and
Eli Gafni
University of California, Los Angeles
and
Michael Merritt
AT&T Bell Laboratories
and
Nir Shavit
Tel­Aviv University
This paper presents a solution to the first­come, first­enabled `­exclusion problem of [?]. Unlike the
solution in [?], this solution does not use powerful read­modify­write synchronization primitives,
and requires only bounded shared memory. Use of the concurrent timestamp system of [?] is key
in solving the problem within bounded shared memory.

  

Source: Afek, Yehuda - School of Computer Science, Tel Aviv University
Shavit, Nir - School of Mathematical Sciences, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences