A scalable and oblivious atomicity assertion

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.


Published in:
Concur 2008 - Concurrency Theory, Proceedings, 5201, 52-66
Presented at:
19th International Conference on Concurrency Theory, Toronto, CANADA, Aug 19-22, 2008
Year:
2008
Publisher:
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
Keywords:
Laboratories:




 Record created 2010-11-30, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)