A mutual exclusion algorithm with optimally bounded bypasses
type: Item
instance of: scholarly article
title: A mutual exclusion algorithm with optimally bounded bypasses
zbMATH Open document ID: 1181.68324
author: K. Alagarsamy
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 5650128
zbMATH Keywords: mutual exclusion
zbMATH Keywords: critical section
zbMATH Keywords: read/write atomicity
zbMATH Keywords: bypasses
zbMATH Keywords: synchronization
zbMATH Keywords: concurrency
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.05.015
OpenAlex ID: W2055596870
cites work: Shared-memory mutual exclusion: major research trends since 1986
cites work: A more efficient generalization of Peterson's mutual exclusion algorithm
cites work: Q4551393
cites work: Myths about the mutual exclusion problem
cites work: Q3813266
cites work: Peterson's mutual exclusion algorithm revisited
cites work: A simple group mutual \(l\)-exclusion algorithm.
DOI: 10.1016/J.IPL.2005.05.015
description: scientific article; zbMATH DE number 5650128