Window-based greedy contention management for transactional memory: theory and practice
From MaRDI portal
Publication:1938368
DOI10.1007/s00446-012-0159-7zbMath1257.68152MaRDI 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 memory; concurrency control; transactional memory; contention management; execution window; greedy transaction scheduling
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W20: Randomized algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Flexible scheduling of transactional memory on trees, Ordered scheduling in control-flow distributed transactional memory, Transactional scheduling for read-dominated workloads, Non-clairvoyant scheduling with conflicts for unit-size jobs, Fast scheduling in distributed transactional memory, Time-communication impossibility results for distributed transactional memory, Dynamic scheduling in distributed transactional memory, Distributed transactional memory for general networks
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