Extended semaphore operations

DOI10.1002/1096-9128(20001225)12:15%3C1495::AID-CPE541%3E3.0.CO;2-FMaRDI QIDQ4790911zbMATH OpenOpenAlexFDO

Authors Stephen Hodgson, Neil Dunstan, Ivan Friš

Publication date 4 February 2003

Full work available at URL https://doi.org/10.1002/1096-9128(20001225)12:15%3C1495::aid-cpe541%3E3.0.co;2-f

zbMATH Keywords

synchronizationconcurrencysemaphores

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• scientific article; zbMATH DE number 1435948
• How to solve the Santa Claus problem
• A new solution of Dijkstra's concurrent programming problem
• scientific article; zbMATH DE number 3924128
• The mutual exclusion problem. I: A theory of interprocess communication

Cites work

• On implementing semaphores with sets
• Some comments on Concurrent readers and writers
• Synchronization with eventcounts and sequencers

Cited in

(2)

• Extending MSVL with semaphore
• scientific article; zbMATH DE number 3924128 (Why is no real title available?)

This page was built for publication: Extended semaphore operations

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