All the operations between the producer class and the consumer class can easily be resumed with the following schema:

• The Producer thread acquires the lock and then inserts data in the QUEUE data structure.
• The Consumer threads get the integers from the QUEUE. These threads acquire the lock before removing data from the QUEUE.

If the QUEUE is empty, then the consumer threads get in a waiting state.

With this recipe, the chapter dedicated to thread-based parallelism comes to an end.