How to solve the Santa Claus problem

DOI10.1002/(SICI)1096-9128(199805)10:6%3C485::AID-CPE329%3E3.0.CO;2-2MaRDI QIDQ4208628zbMATH OpenOpenAlexFDO

Authors Mordechai Ben-Ari

Publication date 14 March 1999

Full work available at URL https://doi.org/10.1002/(sici)1096-9128(199805)10:6%3C485::aid-cpe329%3E3.0.co;2-2

zbMATH Keywords

concurrent programmingSanta Claus problem

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• A new solution of Dijkstra's concurrent programming problem
• scientific article; zbMATH DE number 3848584
• A method for solving synchronization problems
• A new solution to the critical section problem
• Extended semaphore operations

Cited in

(3)

• A type safe state abstraction for coordination in JAVA-like languages
• The Santa Claus problem
• Extended semaphore operations

Describes a project that uses

Uses Software

• Ada95

This page was built for publication: How to solve the Santa Claus problem

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