Transactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operations instantaneously, at some single and unique point in time. Yet, a TM runs transactions concurrently to leverage the parallelism offered by modern processors. The aim of this book is to provide theoretical foundations for transactional memory. This includes defining a model of a TM, as well as answering precisely when a TM implementation is correct, what kind of properties it can ensure, what are the power and limitations of a TM, and what inherent trade-offs are involved in designing a TM algorithm. While the focus of this book is on the fundamental principles, its goal is to capture the common intuition behind the semantics of TMs and the properties of existing TM implementations. Table of Contents: Introduction / Shared Memory Systems / Transactional Memory: A Primer / TM Correctness Issues / Implementing a TM / Further Reading / Opacity / Proving Opacity: An Example / Opacity vs.\ Atomicity / Further Reading / The Liveness of a TM / Lock-Based TMs / Obstruction-Free TMs / General Liveness of TMs / Further Reading / Conclusions

Autorentext

Rachid Guerraoui is professor of computer science at EPFL, the Swiss Federal Institute of Technology in Lausanne. He graduated from the University of Orsay and has also been affiliated with MIT and HP. He chaired the program committees of ACM PODC, ACM Middleware, ECOOP and DISC, and is associate editor of JACM. Michal Kapalka got his PhD from EPFL, the Swiss Federal Institute of Technology in Lausanne, and hisMSc degree from the AGH University of Science and Technology in Kraków, Poland. He currently works for the Swissquote Bank SA.

Inhalt
Introduction.- Shared Memory Systems.- Transactional Memory: A Primer.- TM Correctness Issues.- Implementing a TM.- Further Reading.- Opacity.- Proving Opacity: An Example.- Opacity vs.\ Atomicity.- Further Reading.- The Liveness of a TM.- Lock-Based TMs.- Obstruction-Free TMs.- General Liveness of TMs.- Further Reading.- Conclusions.