Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible

Authors:
Tyler Crain;Damien Imbs;Michel Raynal
Affiliations:
IRISA, Rennes, France;IRISA, Rennes, France;IUF, IRISA, Rennes, France
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 3
Cited 0

On the correctness of transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Permissiveness in Transactional Memories

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This brief announcement studies the relation between two STM properties (read invisibility and permissiveness) and two consistency conditions for STM systems, namely, opacity and virtual world consistency. A read operation issued by a transaction is invisible if it does not entail shared memory modifications. An STM system is permissive with respect to a consistency condition if it accepts every history that satisfies the condition. The brief announcement first shows that read invisibility, permissiveness and opacity are incompatible. It then shows that invisibility, permissiveness and virtual world consistency are compatible.