Ordered scheduling in control-flow distributed transactional memory
From MaRDI portal
Publication:6196835
DOI10.1016/j.tcs.2024.114463OpenAlexW4392104170MaRDI QIDQ6196835
Shishir Rai, Pavan Poudel, Swapnil Guragain
Publication date: 15 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114463
schedulingcompetitive ratiodistributed systemexecution timetransactional memorycommunication costcontrol-flow modelpredefined order
Cites Work
- Unnamed Item
- Unnamed Item
- Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10--12, 2011. Proceedings
- Transactional contention management as a Non-clairvoyant scheduling problem
- The Steiner tree problem
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores
- Window-based greedy contention management for transactional memory: theory and practice
- Distributed transactional memory for metric-space networks
- Time-communication impossibility results for distributed transactional memory
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Load balanced distributed directories
- Distributed transactional memory for general networks
- A competitive analysis for balanced transactional memory workloads
- Impossibility Results for Distributed Transactional Memory
- The Design of Approximation Algorithms
- On Steiner Minimal Trees with Rectilinear Distance
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Software transactional memory
- Toward a theory of transactional contention managers
- Collective dynamics of ‘small-world’ networks
- Distributed Transactional Contention Management as the Traveling Salesman Problem
- Flexible scheduling of transactional memory on trees
This page was built for publication: Ordered scheduling in control-flow distributed transactional memory
