The Bounded-Buffer semaphores
We assume that the pool consists of $ n$ buffers, each capable of holding one item. The mutex semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 1.
The empty and full semaphores count the number of empty and full buffers.
The semaphore empty is initialized to the value n.
The semaphore full is initialized to the value 0.
http://siber.cankaya.edu.tr/ozdogan/OperatingSystems/ceng328/node147.html#6.8
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment