From causal to z-linearizable transactional memory

Torval Riegel, Christof Fetzer, Heiko Sturzrehm, Pascal Felber
2007 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07  
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. In this paper, we investigate the use of weaker
more » ... ntics for TM and introduce a new consistency criterion that we call z-linearizability. By combining properties of linearizability and serializability, zlinearizability provides a good trade-off between strong semantics and good practical performance even for long transactions.
doi:10.1145/1281100.1281162 dblp:conf/podc/RiegelFSF07 fatcat:kvht3lf7xfbcrheru2mybf3muu