Bounds on shared memory for mutual exclusion

DOI10.1006/INCO.1993.1065zbMath0794.68052OpenAlexW2015956262MaRDI QIDQ1317423

James E. Burns, Nancy A. Lynch

Publication date: 24 March 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/252844376fd0319359cc6fc0f512f744a3c9362d

zbMATH Keywords

shared memoryconcurrent programmingmutual exlusion

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items (25)

A visit to mutual exclusion in seven dates ⋮ On the inherent weakness of conditional primitives ⋮ Light-weight leases for storage-centric coordination ⋮ The space complexity of unbounded timestamps ⋮ Lower and upper bounds for single-scanner snapshot implementations ⋮ Progress-Space Tradeoffs in Single-Writer Memory Implementations ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Computing with infinitely many processes ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Active disk Paxos with infinitely many processes ⋮ Heuristic determination of resolving controls for exact and approximate controllability of nonlinear dynamic systems ⋮ Fast timing-based algorithms ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Hundreds of impossibility results for distributed computing ⋮ Linear space bootstrap communication schemes ⋮ A closer look at fault tolerance ⋮ Tight space bounds for \(\ell\)-exclusion ⋮ Recoverable mutual exclusion ⋮ The cost of concurrent, low-contention Read \& Modify \& Write ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention ⋮ Model Checking-Based Genetic Programming with an Application to Mutual Exclusion ⋮ Tight Space Bounds for ℓ-Exclusion ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms ⋮ A Tight Space Bound for Consensus ⋮ Computing in totally anonymous asynchronous shared memory systems

This page was built for publication: Bounds on shared memory for mutual exclusion