Abstract
This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register implementation. The basic idea underlying the low overhead induced by SOAR lies in greedily checking, in a backward manner, specific points of an execution where register operations could be linearized, rather than exploring all possible precedence relations among these.
Details
Title
A scalable and oblivious atomicity assertion
Author(s)
Guerraoui, Rachid ; Vukolic, Marko
Published in
Concur 2008 - Concurrency Theory, Proceedings
Series
Lecture Notes In Computer Science, 5201
Pages
52-66
Conference
19th International Conference on Concurrency Theory, Toronto, CANADA, Aug 19-22, 2008
Date
2008
Publisher
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
Other identifier(s)
View record in Web of Science
Laboratories
DCL
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > DCL - Distributed Computing Laboratory
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Record creation date
2010-11-30