10x-countingSemUsingBinarySem

# 10x-countingSemUsingBinarySem - Implementing counting...

This preview shows pages 1–2. Sign up to view the full content.

Implementing counting semaphores using binary semaphores A. Udaya Shankar http://www.cs.umd.edu/users/shankar/412-Notes/10x-CountingFromBinarySemaphores.html August 11, 2011 1 Introduction Two implementations of counting semaphores using binary semaphores are given below. Implementation 1 is incorrect. Thanks to Timothy Alicie for pointing this out. Implementation 2 (by Barz) is proved to be correct. Assignment is . Equality is " = ". CSem stands for counting semaphores. BSem stands for binary semaphores. References Hans W. Barz. 1983. Implementing semaphores by binary semaphores. SIGPLAN Not. 18, 2 (February 1983), 39-45. DOI=10.1145/948101.948103 http://doi.acm.org/10.1145/948101.948103). David Hemmendinger. 1989. Comments on “A correct and unrestrictive implementation of general semaphores”. SIGOPS Oper. Syst. Rev. 23, 1 (January 1989), 7-8. DOI=10.1145/65762.65763 http://doi.acm.org/10.1145/65762.65763. 2

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/18/2012 for the course INFORMATIK 2011 taught by Professor Phanthuongcang during the Winter '11 term at Cornell.

### Page1 / 3

10x-countingSemUsingBinarySem - Implementing counting...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online