Transactional scheduling for read-dominated workloads
From MaRDI portal
Publication:456006
DOI10.1016/J.JPDC.2012.05.012zbMATH Open1248.68106OpenAlexW2006156072MaRDI QIDQ456006FDOQ456006
Authors: Hagit Attiya, Alessia Milani 
Publication date: 23 October 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00992676/file/AM-OPODIS09.pdf
Recommendations
Cites Work
- Nonclairvoyant scheduling
- The serializability of concurrent database updates
- Atomic snapshots of shared memory
- Toward a theory of transactional contention managers
- Window-based greedy contention management for transactional memory: theory and practice
- A competitive analysis for balanced transactional memory workloads
- Window-based greedy contention management for transactional memory
- Transactional scheduling for read-dominated workloads
- On avoiding spare aborts in transactional memory
- The semantics of progress in lock-based transactional memory
- Bounds on contention management algorithms
- Transactional contention management as a Non-clairvoyant scheduling problem
Cited In (6)
- Transactional scheduling for read-dominated workloads
- Stable scheduling in transactional memory
- Cautious transaction schedulers with admission control
- Time-communication impossibility results for distributed transactional memory
- Window-based greedy contention management for transactional memory: theory and practice
- Title not available (Why is that?)
Uses Software
This page was built for publication: Transactional scheduling for read-dominated workloads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456006)
