Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Beyond Atomic Registers: Bounded Wait-Free Implementations of Nontrivial Objects
 

Summary: Beyond Atomic Registers: Bounded Wait-Free
Implementations of Nontrivial Objects
James H. Andersony
Bojan Groseljz
Department of Computer Science
The University of Maryland at College Park
College Park, Maryland 20742
January 1991
Revised September 1991, June 1992
Abstract
We de ne a class of operations called pseudo read-modify-write (PRMW) operations, and show that non-
trivial shared data objects with such operations can be implemented in a bounded, wait-free manner from
atomic registers. A PRMW operation is similar to a \true" read-modify-write (RMW) operation in that it
modi es the value of a shared variable based upon the original value of that variable. However, unlike an
RMW operation, a PRMW operation does not return the value of the variable that it modi es. We consider
a class of shared data objects that can either be read, written, or modi ed by an associative, commutative
PRMW operation, and show that any object in this class can be implemented without waiting from atomic
registers. The implementations that we present are polynomial in both space and time and thus are an
improvement over previously published ones, all of which have unbounded space complexity.
Keywords: assertional reasoning, atomicity, atomic register, composite register, concurrency, counter, lin-

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences