Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It

  • Hagit Attiya
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6522)


This paper overviews some of the lower bounds on the complexity of implementing software transactional memory, and explains their underlying assumptions. It discusses how these lower bounds align with experimental results and design choices made in existing implementations to indicate that the transactional approach for concurrent programming must compromise either programming simplicity or scalability. There are several contemporary research avenues that address the challenge of concurrent programming. For example, optimizing coarse-grained techniques, and concurrent programming with mini-transactions—simple atomic operations on a small number of locations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hagit Attiya
    • 1
  1. 1.Department of Computer ScienceTechnionIsrael

Personalised recommendations