A competitive analysis for balanced transactional memory workloads

DOI10.1007/S00453-011-9532-3MaRDI QIDQ2429336zbMATH OpenOpenAlexFDO

Authors Gokarna Sharma, Costas Busch

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

competitive ratiosconcurrency controltransactional memorycontention managementtransaction schedulingbalanced workloads

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 871903 (Why is no real title available?)
• Approximation algorithms for NP-hard problems.
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Bounds on contention management algorithms
• Local Labeling and Resource Allocation Using Preprocessing
• Multicoloring trees.
• Mutual exclusion scheduling
• Nonclairvoyant scheduling
• Restrictions of graph partition problems. I
• Scheduling with conflicts: Online and offline algorithms
• Software transactional memory
• Toward a theory of transactional contention managers
• Transactional contention management as a Non-clairvoyant scheduling problem
• Window-based greedy contention management for transactional memory
• Zero knowledge and the chromatic number

Cited in

(15)

• Non-clairvoyant scheduling with conflicts for unit-size jobs
• Bounds on contention management algorithms
• Flexible scheduling of transactional memory on trees
• Distributed transactional contention management as the traveling salesman problem
• Transactional scheduling for read-dominated workloads
• Bounds on contention management algorithms
• Distributed transactional memory for general networks
• Transactional contention management as a Non-clairvoyant scheduling problem
• Ordered scheduling in control-flow distributed transactional memory
• Transactional contention management as a non-clairvoyant scheduling problem
• Window-based greedy contention management for transactional memory
• Time-communication impossibility results for distributed transactional memory
• Window-based greedy contention management for transactional memory: theory and practice
• Fast scheduling in distributed transactional memory
• Toward a theory of transactional contention managers

Describes a project that uses

Uses Software

• STAMP
• STMBench7

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

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