A competitive analysis for balanced transactional memory workloads

DOI10.1007/s00453-011-9532-3zbMath1236.68018OpenAlexW1645186466MaRDI QIDQ2429336

Costas Busch, Gokarna Sharma

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9532-3

zbMATH Keywords

concurrency controlcompetitive ratiostransactional memorycontention managementtransaction schedulingbalanced workloads

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (7)

Flexible scheduling of transactional memory on trees ⋮ Ordered scheduling in control-flow distributed transactional memory ⋮ Transactional scheduling for read-dominated workloads ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ Distributed transactional memory for general networks ⋮ Fast scheduling in distributed transactional memory ⋮ Time-communication impossibility results for distributed transactional memory

Uses Software

• STMBench7
• STAMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restrictions of graph partition problems. I
• Scheduling with conflicts: Online and offline algorithms
• Transactional contention management as a Non-clairvoyant scheduling problem
• Zero knowledge and the chromatic number
• Nonclairvoyant scheduling
• Mutual exclusion scheduling
• Multicoloring trees.
• Window-Based Greedy Contention Management for Transactional Memory
• Bounds on Contention Management Algorithms
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Local Labeling and Resource Allocation Using Preprocessing
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: A competitive analysis for balanced transactional memory workloads