Ordered scheduling in control-flow distributed transactional memory
From MaRDI portal
Publication:6196835
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- A competitive analysis for balanced transactional memory workloads
- Collective dynamics of `small-world' networks
- Distributed transactional contention management as the traveling salesman problem
- Distributed transactional memory for general networks
- Distributed transactional memory for metric-space networks
- Flexible scheduling of transactional memory on trees
- Impossibility results for distributed transactional memory
- Load balanced distributed directories
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- On Steiner Minimal Trees with Rectilinear Distance
- Software transactional memory
- Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10--12, 2011. Proceedings
- The Steiner tree problem
- The design of approximation algorithms
- Time-communication impossibility results for distributed transactional memory
- Toward a theory of transactional contention managers
- Transactional contention management as a Non-clairvoyant scheduling problem
- Window-based greedy contention management for transactional memory: theory and practice
- Worst-case analysis of a new heuristic for the travelling salesman problem
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores
This page was built for publication: Ordered scheduling in control-flow distributed transactional memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196835)
