Window-based greedy contention management for transactional memory: theory and practice
- 2 February 2012
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 25 (3) , 225-248
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Transactional Contention Management as a Non-Clairvoyant Scheduling ProblemAlgorithmica, 2008
- STMBench7ACM SIGOPS Operating Systems Review, 2007
- A flexible framework for implementing software transactional memoryACM SIGPLAN Notices, 2006
- Transactional coherence and consistency: simplifying parallel hardware and softwareIEEE Micro, 2004
- Language support for lightweight transactionsACM SIGPLAN Notices, 2003
- Software transactional memoryDistributed Computing, 1997
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Nonclairvoyant schedulingTheoretical Computer Science, 1994
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990