Bounds on contention management algorithms
type: Item
instance of: scholarly article
title: Bounds on contention management algorithms
zbMATH Open document ID: 1217.68251
author: Jianyong Qiao
author: Sumit K. Garg
published in: Theoretical Computer Science
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5932530
zbMATH Keywords: scheduling
zbMATH Keywords: transactions
zbMATH Keywords: transactional memory
zbMATH Keywords: concurrency control
zbMATH Keywords: contention management
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.10.010
OpenAlex ID: W2178984928
cites work: Transactional contention management as a non-clairvoyant scheduling problem
cites work: On chromatic sums and distributed resource allocation
cites work: Scheduling with conflicts: Online and offline algorithms
cites work: Toward a theory of transactional contention managers
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: A Lazy Snapshot Algorithm with Eager Validation
cites work: Bounds on Contention Management Algorithms
cites work: Coloring unstructured wireless multi-hop networks
cites work: A new technique for distributed symmetry breaking
cites work: Window-Based Greedy Contention Management for Transactional Memory
DOI: 10.1016/J.TCS.2010.10.010
description: scientific article; zbMATH DE number 5932530