Window-based greedy contention management for transactional memory: theory and practice
DOI10.1007/s00446-012-0159-7zbMath1257.68152OpenAlexW2044636013MaRDI QIDQ1938368
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-012-0159-7
shared memoryconcurrency controltransactional memorycontention managementexecution windowgreedy transaction scheduling
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Transactional scheduling for read-dominated workloads
- Bounds on contention management algorithms
- Restrictions of graph partition problems. I
- Scheduling with conflicts: Online and offline algorithms
- Transactional contention management as a Non-clairvoyant scheduling problem
- Nonclairvoyant scheduling
- Mutual exclusion scheduling
- Multicoloring trees.
- Window-Based Greedy Contention Management for Transactional Memory
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Toward a theory of transactional contention managers
- Software transactional memory
This page was built for publication: Window-based greedy contention management for transactional memory: theory and practice