The bounded-buffer problems (aka the producer-consumer problem) is a classic example of concurrent access to a shared resource. A bounded buffer lets multiple producers and multiple consumers share a single buffer. Producers write data to the buffer and consumers read data from the buffer.

Which data structure is used in solution to a bounded buffer problem?

Here's a Solution

One solution of this problem is to use semaphores. The semaphores which will be used here are: m , a binary semaphore which is used to acquire and release the lock. empty , a counting semaphore whose initial value is the number of slots in the buffer, since, initially all slots are empty.

What is the other term for bounded buffer problem?

Bounded Buffer problem is also called producer consumer problem. It is problem based on synchronization. This problem is generalized in terms of the Producer-Consumer problem.