A fine-grained solution to the mutual exclusion problem

DOI10.1007/BF01179373zbMath0790.68048OpenAlexW1967425719MaRDI QIDQ1323338

James H. Anderson

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01179373

zbMATH Keywords

concurrent programmingmutual exclusion problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Distributed algorithms (68W15)

Related Items (5)

Nonatomic mutual exclusion with local spinning ⋮ Adaptive mutual exclusion with local spinning ⋮ A fast, scalable mutual exclusion algorithm ⋮ Using local-spin k -exclusion algorithms to improve wait-free object implementations ⋮ Nonatomic dual bakery algorithm with bounded tokens

Cites Work

• Unnamed Item
• On interprocess communication. I: Basic formalism
• Atomic semantics of nonatomic programs
• Myths about the mutual exclusion problem
• A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
• The mutual exclusion problem

This page was built for publication: A fine-grained solution to the mutual exclusion problem