conference paper
A scalable and oblivious atomicity assertion
2008
Concur 2008 - Concurrency Theory, Proceedings
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.
Type
conference paper
Web of Science ID
WOS:000259487000004
Author(s)
Vukolic, Marko
Date Issued
2008
Published in
Concur 2008 - Concurrency Theory, Proceedings
Series title/Series vol.
Lecture Notes In Computer Science; 5201
Start page
52
End page
66
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
| Event name | Event place | Event date |
Toronto, CANADA | Aug 19-22, 2008 | |
Available on Infoscience
November 30, 2010
Use this identifier to reference this record