Transactional scheduling for read-dominated workloads

DOI10.1016/j.jpdc.2012.05.012zbMath1248.68106OpenAlexW2006156072MaRDI QIDQ456006

Alessia Milani, Hagit Attiya

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

zbMATH Keywords

schedulingcompetitive analysisread-dominated workloadtransactional memory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Stable scheduling in transactional memory ⋮ Window-based greedy contention management for transactional memory: theory and practice ⋮ Transactional scheduling for read-dominated workloads ⋮ Time-communication impossibility results for distributed transactional memory

Uses Software

• STMBench7

Cites Work

• Transactional scheduling for read-dominated workloads
• On avoiding spare aborts in transactional memory
• Bounds on contention management algorithms
• Transactional contention management as a Non-clairvoyant scheduling problem
• Nonclairvoyant scheduling
• 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
• The serializability of concurrent database updates
• Atomic snapshots of shared memory
• Toward a theory of transactional contention managers
• The semantics of progress in lock-based transactional memory

This page was built for publication: Transactional scheduling for read-dominated workloads