Options
From Causal to z-Linearizable Transactional Memory
Auteur(s)
Riegel, Torvald
Editeur(s)
Date de parution
2007
In
Proceedings of the 26th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'07), Association for Computing Machinery (ACM), 2007///1-13
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.
Autre version
http://portal.acm.org/citation.cfm?id=1281162
Type de publication
Resource Types::text::journal::journal article
Dossier(s) à télécharger
