Time-communication impossibility results for distributed transactional memory
DOI10.1007/s00446-017-0318-yzbMath1482.68062OpenAlexW2785159959WikidataQ129292764 ScholiaQ129292764MaRDI QIDQ2075626
Costas Busch, Gokarna Sharma, Miroslav Popovic, Maurice P. Herlihy
Publication date: 15 February 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0318-y
distributed systemsimpossibility resultsexecution timetransactional memorynetwork congestioncommunication cost
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- On speculative replication of transactional systems
- Transactional scheduling for read-dominated workloads
- Bounds on contention management algorithms
- 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
- Distributed transactional memory for general networks
- A competitive analysis for balanced transactional memory workloads
- Universal approximations for TSP, Steiner tree, and set cover
- Improved lower and upper bounds for universal TSP in planar metrics
- Toward a theory of transactional contention managers
- Software transactional memory
- Distributed Transactional Contention Management as the Traveling Salesman Problem
This page was built for publication: Time-communication impossibility results for distributed transactional memory