Transactional contention management as a Non-clairvoyant scheduling problem

DOI10.1007/S00453-008-9195-XMaRDI QIDQ848634zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir

Publication date 4 March 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-008-9195-x

zbMATH Keywords

Concurrency controlContention managementSchedulingSoftware transactional memoryTransactions

Mathematics Subject Classification ID

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

Recommendations

• Transactional contention management as a non-clairvoyant scheduling problem
• A competitive analysis for balanced transactional memory workloads
• Toward a theory of transactional contention managers
• Bounds on contention management algorithms
• Bounds on contention management algorithms

Cites work

• Fault-Tolerant Scheduling
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 571325 (Why is no real title available?)
• scientific article; zbMATH DE number 871903 (Why is no real title available?)
• Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
• Nonclairvoyant scheduling
• Toward a theory of transactional contention managers

Cited in

(12)

• Non-clairvoyant scheduling with conflicts for unit-size jobs
• Window-based greedy contention management for transactional memory: theory and practice
• Fast scheduling in distributed transactional memory
• Time-communication impossibility results for distributed transactional memory
• Dynamic scheduling in distributed transactional memory
• A competitive analysis for balanced transactional memory workloads
• Transactional scheduling for read-dominated workloads
• Toward a theory of transactional contention managers
• Transactional contention management as a non-clairvoyant scheduling problem
• Stable scheduling in transactional memory
• Flexible scheduling of transactional memory on trees
• Ordered scheduling in control-flow distributed transactional memory

This page was built for publication: Transactional contention management as a Non-clairvoyant scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848634)