Transactional scheduling for read-dominated workloads

DOI10.1016/J.JPDC.2012.05.012MaRDI QIDQ456006zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

competitive analysisschedulingread-dominated workloadtransactional memory

Mathematics Subject Classification ID

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

Recommendations

• Fast scheduling in distributed transactional memory
• Stable scheduling in transactional memory
• Dynamic scheduling in distributed transactional memory
• Flexible scheduling of transactional memory on trees

Cites work

• A competitive analysis for balanced transactional memory workloads
• Atomic snapshots of shared memory
• Bounds on contention management algorithms
• Nonclairvoyant scheduling
• On avoiding spare aborts in transactional memory
• The semantics of progress in lock-based transactional memory
• The serializability of concurrent database updates
• Toward a theory of transactional contention managers
• Transactional contention management as a Non-clairvoyant scheduling problem
• Transactional scheduling for read-dominated workloads
• Window-based greedy contention management for transactional memory
• Window-based greedy contention management for transactional memory: theory and practice

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
• scientific article; zbMATH DE number 7699455 (Why is no real title available?)

Describes a project that uses

Uses Software

• STMBench7

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)