Transactional contention management as a non-clairvoyant scheduling problem

DOI10.1145/1146381.1146428zbMATH Open1314.68082OpenAlexW2072544773MaRDI QIDQ5177293FDOQ5177293

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

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

zbMATH Keywords

schedulingconcurrency controlsoftware transactional memorycontention managementtransactions

Mathematics Subject Classification ID

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

Cited In (7)

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

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)