From Causal to z-Linearizable Transactional Memory

Torvald Riegel, Christof Fetzer, Heiko Sturzrehm & Pascal Felber

Résumé The current generation of time-based transactional memories (TMs) has the advantage of being simple and efficient, and providing strong linearizability semantics. Linearizability matches well the goal of TM to simplify the design and implementation of concurrent applications. However, long transactions can have a much lower likelihood of committing than smaller transactions because of the strict ordering constraints imposed by linearizability. We investigate the use of weaker semantics for TM and introduce a new consistency criterion that we call z-linearizability. By combining properties of linearizability and serializability, z-linearizability provides a good trade-off between strong semantics and good practical performance even for long transactions.
Mots-clés Transactional memory, causal serializability, linearizability
Citation T. Riegel, et al., "From Causal to z-Linearizable Transactional Memory," in 16th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, 2007, p. 340-341.
Type Actes de congrès (Anglais)
Nom de la conférence 16th Annual ACM Symposium on Principles of Distributed Computing (Portland, OR)
Date de la conférence 2007
Editeur commercial Assoc Computing Machinery
Pages 340-341