ON THE INPUT ACCEPTANCE OF TRANSACTIONAL MEMORY
- Gramoli, Vincent Université de Neuchâtel, rue Emile-Argand 11, CH-2007 Neuchâtel, Switzerland
- Harmanci, Derin Université de Neuchâtel, rue Emile-Argand 11, CH-2007 Neuchâtel, Switzerland
- Felber, Pascal Université de Neuchâtel, rue Emile-Argand 11, CH-2007 Neuchâtel, Switzerland
- 2012-4-30
Published in:
- Parallel Processing Letters. - World Scientific Pub Co Pte Lt. - 2010, vol. 20, no. 01, p. 31-50
English
We present the Input Acceptance of Transactional Memory (TM). Despite the large interest for performance of TMs, no existing research work has investigated the impact of solving a conflict that does not need to be solved. Traditional solutions for a TM to be correct is to delay or abort a transaction as soon as it presents a risk to violate consistency. Both alternatives are costly and should be avoided if consistency is actually preserved. To address this problem, we introduce the input acceptance of a TM as its ability to commit transactions, we upper-bound the input acceptance of existing TMs and propose a new TM with higher input acceptance.
- Language
-
- English
- Open access status
- green
- Identifiers
-
- DOI 10.1142/s0129626410000041
- ISSN 0129-6264
- Persistent URL
- https://sonar.ch/global/documents/256302
Statistics
Document views: 28
File downloads:
- Full-text: 0