Invited paper: The inherent complexity of transactional memory and what to do about it

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings
Pages1-11
Number of pages11
DOIs
StatePublished - 2011
Event12th International Conference on Distributed Computing and Networking, ICDCN 2011 - Bangalore, India
Duration: 2 Jan 20115 Jan 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6522 LNCS

Conference

Conference12th International Conference on Distributed Computing and Networking, ICDCN 2011
Country/TerritoryIndia
CityBangalore
Period2/01/115/01/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Invited paper: The inherent complexity of transactional memory and what to do about it'. Together they form a unique fingerprint.

Cite this