What is bounded-buffer problem? | Operating Systems LAB VIVA

Here we assume that a pool consists of n buffers, each capable of holding one item. The 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, respectively. Empty is initialized to n, and full is initialized to 0.

Leave a Reply

Your email address will not be published. Required fields are marked *