Pages that link to "Item:Q5177247"
From MaRDI portal
The following pages link to Toward a theory of transactional contention managers (Q5177247):
Displaying 24 items.
- Towards a universal construction for transaction-based multiprocess programs (Q391265) (← links)
- Transactional scheduling for read-dominated workloads (Q456006) (← links)
- Contention-sensitive data structures and algorithms (Q526873) (← links)
- Good programming in transactional memory: game theory meets multicore architecture (Q553350) (← links)
- Bounds on contention management algorithms (Q553351) (← links)
- Transactional memory (Q666225) (← links)
- Adaptive locks: combining transactions and locks for efficient concurrency (Q666229) (← links)
- Extensible transactional memory testbed (Q666242) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Adaptive progress: a gracefully-degrading liveness property (Q992505) (← links)
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores (Q1656883) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- The weakest failure detectors to boost obstruction-freedom (Q1954262) (← links)
- The computational structure of progress conditions and shared objects (Q1988520) (← links)
- Fast scheduling in distributed transactional memory (Q2035479) (← links)
- Time-communication impossibility results for distributed transactional memory (Q2075626) (← links)
- Dynamic scheduling in distributed transactional memory (Q2121056) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- Model checking transactional memories (Q2377134) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Flexible scheduling of transactional memory on trees (Q6073888) (← links)
- Ordered scheduling in control-flow distributed transactional memory (Q6196835) (← links)
