Bounds on contention management algorithms

DOI10.1016/j.tcs.2010.10.010zbMath1217.68251OpenAlexW2178984928MaRDI QIDQ553351

Jianyong Qiao, Sumit K. Garg

Publication date: 27 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.010

zbMATH Keywords

schedulingconcurrency controltransactional memorycontention managementtransactions

Mathematics Subject Classification ID

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

Related Items

Window-based greedy contention management for transactional memory: theory and practice ⋮ Transactional scheduling for read-dominated workloads ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ Time-communication impossibility results for distributed transactional memory

Cites Work

• Scheduling with conflicts: Online and offline algorithms
• On chromatic sums and distributed resource allocation
• A Lazy Snapshot Algorithm with Eager Validation
• Window-Based Greedy Contention Management for Transactional Memory
• Bounds on Contention Management Algorithms
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Coloring unstructured wireless multi-hop networks
• A new technique for distributed symmetry breaking
• Toward a theory of transactional contention managers
• Transactional contention management as a non-clairvoyant scheduling problem