A new exercise in concurrency

Abstract

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.

References

1. [1] Courtois, P.J., Heymans, F. and Parnas, D.L. Concurrent Control with Readers and Writers, Communications of the ACM, Vol. 10, # 10, 667-668, 1971.
2. [2] Hemmendinger, D. A Correct Implementation of General Semaphores, ACM Operating Systems Review, Vol. 22, #3, 46-48, 1988.
3. [3] Hemmendinger, D. Comments on "A Correct and Unrestrictive Implementation of General Semaphores", ACM Operating Systems Review, Vol. 23, #1, 7-8, 1988.
4. [4] Hsieh, C.S. Further Comments on Implementation of General Semaphores, ACM Operating Systems Review, Vol. 23, #1, 9- 10, 1989.
5. [5] Kearns, P. A Correct and Unrestrictive Implementation of General Semaphores, ACM Operating Systems Review, Vol. 22 #4, 46- 48, 1988.
6. [6] Holt, R.C., Graham, G.S., Lazowska E.D. and Scott, M.A. Structured Concurrent Programming with Operating Systems Applications, Addison Wesley, 1978. (Exercise #19, page 109.).
7. [7] Kotulski, L. Comments on Implementation of P and V Primitives with help of Binary Semaphores, ACM Operating Systems Review, Vol. 22 #2, 53-59, 1988.
8. [8] Peterson, J.L., and Silberschatz, A. Operating Systems Concepts, Addison Wesley, 1985.
9. [9] Patil, S.S. Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination Among Processes, MIT Project MAC Computational Structures Group Memo, # 57, 1971.
10. [10] Silberschatz, A., and Galvin, P. Operating Systems Concepts, Addison Wesley, 1994.
11. [11] Tanenbaum, A.S. Modern Operating Systems, Prentice Hall, 1992.

Index Terms

• Social and professional topics

  • Professional topics

    • Computing education

      • Computing education programs

        • Computer science education

• Software and its engineering