Transactional contention management as a Non-clairvoyant scheduling problem

DOI10.1007/s00453-008-9195-xzbMath1184.68118OpenAlexW2161205537MaRDI QIDQ848634

Hadas Shachnai, Tami Tamir, Leah Epstein, Hagit Attiya

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

SchedulingTransactionsConcurrency controlContention managementSoftware transactional memory

Mathematics Subject Classification ID

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

Related Items (10)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonclairvoyant scheduling
• Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
• Toward a theory of transactional contention managers
• Fault-Tolerant Scheduling

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