Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Comments on implementation of P and V primitives with help of binary semaphores
ACM SIGOPS Operating Systems Review
A correct implementation of general semaphores
ACM SIGOPS Operating Systems Review
A correct and unrestrictive implementation of general semaphores
ACM SIGOPS Operating Systems Review
Comments on “a correct and unrestrictive implementation of general semaphores”
ACM SIGOPS Operating Systems Review
Further comments on implementation of general semaphores
ACM SIGOPS Operating Systems Review
Operating system concepts (3rd ed.)
Operating system concepts (3rd ed.)
Modern operating systems
Concurrent control with “readers” and “writers”
Communications of the ACM
After you, Alfonse: a mutual exclusion toolkit
SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Modern concurrency abstractions for C#
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combined Static and Dynamic Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Santa Claus: Formal analysis of a process-oriented solution
ACM Transactions on Programming Languages and Systems (TOPLAS)
Actors with multi-headed message receive patterns
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Scalable efficient composite event detection
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
This article presents an exercise to be assigned whenever undergraduates are introduced to the concepts of concurrency and semaphores. It also presents several possible strategies to solve said exercise along with a "coded" solution.