Window-based greedy contention management for transactional memory: theory and practice
type: Item
instance of: scholarly article
title: Window-based greedy contention management for transactional memory: theory and practice
zbMATH Open document ID: 1257.68152
author: Gokarna Sharma
author: Costas Busch
published in: Distributed Computing
publication date: 2013-02-04T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6134273
zbMATH Keywords: transactional memory
zbMATH Keywords: execution window
zbMATH Keywords: contention management
zbMATH Keywords: greedy transaction scheduling
zbMATH Keywords: shared memory
zbMATH Keywords: concurrency control
describes a project that uses: STAMP
describes a project that uses: STMBench7
MaRDI profile type: Publication
full work available at URL: s00446-012-0159-7
OpenAlex ID: W2044636013
cites work: Transactional contention management as a Non-clairvoyant scheduling problem
cites work: Transactional scheduling for read-dominated workloads
cites work: Mutual exclusion scheduling
cites work: Restrictions of graph partition problems. I
cites work: Scheduling with conflicts: Online and offline algorithms
cites work: Bounds for Multiprocessor Scheduling with Resource Constraints
cites work: Toward a theory of transactional contention managers
cites work: Multicoloring trees.
cites work: Q4875172
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Nonclairvoyant scheduling
cites work: Bounds on contention management algorithms
cites work: Window-Based Greedy Contention Management for Transactional Memory
cites work: Software transactional memory
DOI: 10.1007/S00446-012-0159-7
description: scientific article; zbMATH DE number 6134273