Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Computing with Reads and Writes in the Absence of Step Contention

Summary: Computing with Reads and Writes
in the Absence of Step Contention
(Extended Abstract)
Hagit Attiya1
, Rachid Guerraoui2
, and Petr Kouznetsov2
Department of Computer Science, Technion
School of Computer and Communication Sciences, EPFL
Abstract. This paper studies implementations of concurrent objects
that exploit the absence of step contention. These implementations use
only reads and writes when a process is running solo. The other pro-
cesses might be busy with other objects, swapped-out, failed, or simply
delayed by a contention manager. We study in this paper two classes
of such implementations, according to how they handle the case of step
contention. The first kind, called obstruction-free implementations, are
not required to terminate in that case. The second kind, called solo-fast
implementations, terminate using powerful operations (e.g., C&S).
We present a generic obstruction-free object implementation that has


Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology


Collections: Computer Technologies and Information Sciences