Transactional contention management as a non-clairvoyant scheduling problem

DOI10.1145/1146381.1146428zbMath1314.68082OpenAlexW2072544773MaRDI QIDQ5177293

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

schedulingconcurrency controlsoftware transactional memorycontention managementtransactions

Mathematics Subject Classification ID

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

Related Items (3)

On avoiding spare aborts in transactional memory ⋮ Good programming in transactional memory: game theory meets multicore architecture ⋮ Bounds on contention management algorithms

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