Dynamic scheduling in distributed transactional memory
From MaRDI portal
Publication:2121056
DOI10.1007/s00446-021-00410-wzbMath1483.68036OpenAlexW3217541780MaRDI QIDQ2121056
Costas Busch, Gokarna Sharma, Miroslav Popovic, Maurice P. Herlihy
Publication date: 1 April 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-021-00410-w
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- On speculative replication of transactional systems
- Transactional contention management as a Non-clairvoyant scheduling problem
- Window-based greedy contention management for transactional memory: theory and practice
- Distributed transactional memory for metric-space networks
- Fast scheduling in distributed transactional memory
- Time-communication impossibility results for distributed transactional memory
- Distributed transactional memory for general networks
- Oblivious network design
- Software transactional memory
- Toward a theory of transactional contention managers
- Distributed Transactional Contention Management as the Traveling Salesman Problem
This page was built for publication: Dynamic scheduling in distributed transactional memory