Rankers: A classification of synchronization problems

DOI10.1016/0167-6423(93)90009-EMaRDI QIDQ1314537zbMATH OpenOpenAlexFDO

Authors Ambuj Singh, Mohamed G. Gouda

Publication date 17 February 1994

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(93)90009-e

zbMATH Keywords

concurrent computationdining philosophersmutual exclusionresource allocationspecificationsynchronization

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Recommendations

• A method for solving synchronization problems
• The Power of Synchronization Mechanisms
• Arbitration-free synchronization
• On the family of critical section problems
• scientific article; zbMATH DE number 4056962

Cited in

(4)

• A modular drinking philosophers algorithm
• The Power of Synchronization Mechanisms
• Arbitration-free synchronization
• A method for solving synchronization problems

This page was built for publication: Rankers: A classification of synchronization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314537)