RFR: Classic problem 02 producer consumer problem

[Michael Mirwaldt]

On Mon, 8 Nov 2021 21:18:24 GMT, Michael Mirwaldt <duke at openjdk.java.net> wrote:

> This sample implements some solutions from the wikipedia article about the producer-consumer-problem on https://en.wikipedia.org/wiki/Producer%E2%80%93consumer_problem .
> It contains these solutions:
> - _OneProducerOneConsumer_ with semaphores
> - _FlawedTwoProducersOneConsumer_ with semaphores in which the producers sometimes use the same index for their items and overwrite each others item in the buffer
> - _FixedTwoProducersOneConsumer_ with semaphores which uses an extra lock for the index so that the producers never use the same index for their items
> - _Lock_ doesn't use any sempahores but a reentrant lock with two conditions. It supports many producers and many consumers
> - _AtomicIntegers_ neither uses any semaphores but two atomic integers and supports one producer and one consumer.
> 
> I have decided not to implement the last solution with finite-range single writer registers in the wikipedia article. It looked far too complicated to me.

I create a new branch and PR to avoid the squash

-------------

PR: https://git.openjdk.java.net/jcstress/pull/102