Modular transactional memory

Authors:
Matthew Brecknell;Paul Roe
Affiliations:
Queensland University of Technology, Australia;Queensland University of Technology, Australia
Venue:
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Year:
2010

Citing 13
Cited 0

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent Haskell

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Composable memory transactions

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Toward a theory of transactional contention managers

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Transactional Memory (Synthesis Lectures on Computer Architecture)

Transactional Memory (Synthesis Lectures on Computer Architecture)
Open nesting in software transactional memory

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
On the correctness of transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Transactional boosting: a methodology for highly-concurrent transactional objects

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Safer open-nested transactions through ownership

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Model checking transactional memories

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Data types à la carte

Journal of Functional Programming
Committing conflicting transactions in an STM

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Stretching transactional memory

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Software transactional memory has the potential to greatly simplify development of concurrent software, by supporting safe composition of concurrent shared-state abstractions. However, STM semantics are defined in terms of low-level reads and writes on individual memory locations, so implementations are unable to take advantage of the properties of user-defined abstractions. Consequently, the performance of transactions over some structures can be disappointing. We present Modular Transactional Memory, our framework which allows programmers to extend STM with concurrency control algorithms tailored to the data structures they use in concurrent programs. We describe our implementation in Concurrent Haskell, and two example structures: a finite map which allows concurrent transactions to operate on disjoint sets of keys, and a non-deterministic channel which supports concurrent sources and sinks. Our approach is based on previous work by others on boosted and open-nested transactions, with one significant development: transactions are given types which denote the concurrency control algorithms they employ. Typed transactions offer a higher level of assurance for programmers reusing transactional code, and allow more flexible abstract concurrency control.