Toward a Theory of Input Acceptance for Transactional Memories

Authors:
Vincent Gramoli;Derin Harmanci;Pascal Felber
Affiliations:
School of Computer and Communication Sciences, EPFL, Switzerland and University of Neuchâtel, Switzerland CH-2009;University of Neuchâtel, Switzerland CH-2009;University of Neuchâtel, Switzerland CH-2009
Venue:
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Year:
2008

Citing 9
Cited 4

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
The serializability of concurrent database updates

Journal of the ACM (JACM)
Serializability by Locking

Journal of the ACM (JACM)
Software transactional memory for dynamic-sized data structures

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Language support for lightweight transactions

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
From causal to z-linearizable transactional memory

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On the correctness of transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Dynamic performance tuning of word-based software transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Transactional locking II

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Transactional Memory: Glimmer of a Theory

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Extensible transactional memory testbed

Journal of Parallel and Distributed Computing
Invited paper: the inherent complexity of transactional memory and what to do about it

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Single-version STMs can be multi-version permissive

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transactional memory (TM) systems receive as an input a stream of events also known as a workload , reschedule it with respect to several constraints, and output a consistent history. In multicore architectures, the transactional code executed by a processor is a stream of events whose interruption would waste processor cycles. In this paper, we formalize the notion of TM workload into classes of input patterns, whose acceptance helps understanding the performance of a given TM.