Bounds on contention management algorithms

DOI10.1007/978-3-642-10631-6_46MaRDI QIDQ3652232zbMATH OpenOpenAlexFDO

Authors

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_46

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Bounds on contention management algorithms
• Window-based greedy contention management for transactional memory
• A competitive analysis for balanced transactional memory workloads
• Window-based greedy contention management for transactional memory: theory and practice
• Transactional contention management as a non-clairvoyant scheduling problem

Cited in

(10)

• Window-based greedy contention management for transactional memory: theory and practice
• Built-in coloring for highly-concurrent doubly-linked lists
• A competitive analysis for balanced transactional memory workloads
• Window-based greedy contention management for transactional memory
• Transactional contention management as a non-clairvoyant scheduling problem
• Distributed transactional contention management as the traveling salesman problem
• Good programming in transactional memory: game theory meets multicore architecture
• Bounds on contention management algorithms
• Highly concurrent multi-word synchronization
• Transactional contention management as a Non-clairvoyant scheduling problem

This page was built for publication: Bounds on contention management algorithms

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