Transactional contention management as a non-clairvoyant scheduling problem

DOI10.1145/1146381.1146428MaRDI QIDQ5177293zbMATH OpenOpenAlexFDO

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

Publication date 10 March 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1146381.1146428

zbMATH Keywords

concurrency controlcontention managementschedulingsoftware transactional memorytransactions

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Distributed algorithms (68W15)

Recommendations

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

Cited in

(8)

• A competitive analysis for balanced transactional memory workloads
• Bounds on contention management algorithms
• On avoiding spare aborts in transactional memory
• Toward a theory of transactional contention managers
• Good programming in transactional memory: game theory meets multicore architecture
• Bounds on contention management algorithms
• Fast and fair randomized wait-free locks
• Transactional contention management as a Non-clairvoyant scheduling problem

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 Q5177293)