On the Cost of Concurrency in Transactional Memory
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 112-127
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Principles of Transactional MemorySynthesis Lectures on Distributed Computing Theory, 2010
- The semantics of progress in lock-based transactional memoryACM SIGPLAN Notices, 2009
- Elastic Transactions2009
- Permissiveness in Transactional Memories2008
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO AlgorithmsLecture Notes in Computer Science, 2004
- Shared memory consistency models: a tutorialComputer, 1996
- The performance of spin lock alternatives for shared-memory multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- Defining livenessInformation Processing Letters, 1985
- The serializability of concurrent database updatesJournal of the ACM, 1979
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974