skip to main content
article
Free Access

Further comments on "A Correct and Unrestrictive Implementation of General Semaphores"

Published:01 July 2000Publication History
Skip Abstract Section

Abstract

Over a decade ago, a race condition was discovered in a specific implementation of the counting semaphore operations P and V. Several corrections to that implementation were published. These were subsequently critiqued and eventually the discussion ended. This article will expose a newly discovered race condition in one of the corrections.

References

  1. Barz, H. W. Implementing semaphores by binary semaphores. SIGPLAN Notices, volume 18, number 2, (February, 1983), pp 39-45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bic, L. and Shaw, A. C. The Logical Design of Operating Systems. Prentice-Hall, second edition (1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Hartley, S. Concurrent Programming: The Java Programming Language. Oxford University Press, (1998), page 114. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Hemmendinger, D. A correct implementation of general semaphores. Operating Systems Review, volume 22, number 3, (July, 1988), pp. 42-44. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Hemmendinger, D. Comments on "A correct implementation of general semaphores". Operating Systems Review, volume 23, number 1, (January, 1989), pp. 7-8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Hsieh, C. S. Further comments on implementation of general semaphores. Operating Systems Review, volume 23, number 1, (January, 1989), pp. 9-10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Kearns, P. A correct and unrestrictive implementation of general semaphores. Operating Systems Review, volume 22, number 4, (October, 1988), pp. 46-48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Kotulski, L. Comments on implementation of P and V primitives with help of binary semaphores. Operating System Review, volume 22, number 2, (April, 1988), pp.53-59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Lipton, R. J., Snyder, L. and Zalcstein, Y. Evaluation criteria for process synchronization. Sagamore Conference on Parallel Processing, (1975), pp. 245-250.Google ScholarGoogle Scholar
  10. Perrot, R. H. Concurrent Programming: Microcomputers, in Microcomputer System Design (Lecture Notes in Computer Science, number 126), Springer Verlag, (1982), page 254.Google ScholarGoogle Scholar
  11. Peterson, J. and Silberschatz, A. Operating Systems Concepts, Addison-Wesley, second edition, (1985). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Shaw, A. C. The Logical Design of Operating Systems. Prentice Hall, first edition, (1974). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Stallings, W. Operating Systems: Internals and Design Principles. Prentice Hall, third edition, (1998). Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGOPS Operating Systems Review
    ACM SIGOPS Operating Systems Review  Volume 34, Issue 3
    July 2000
    76 pages
    ISSN:0163-5980
    DOI:10.1145/506117
    Issue’s Table of Contents

    Copyright © 2000 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 July 2000

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader