RFR: CODETOOLS-7903021: jcstress: Dining Philosophers problem sample

[Aleksey Shipilev]

On Thu, 26 Aug 2021 17:28:34 GMT, Michael Mirwaldt <github.com+6693355+mmirwaldt at openjdk.org> wrote:

> This s my initial draft fo a sample testing solutions for the dining philosophers problem:
> - Wikipedia explains it on https://en.wikipedia.org/wiki/Dining_philosophers_problem
> - It runs within 13min on my machine.
> - It includes a short comment about the motivation for that sample and
> a reference link to the wikipedia article about the dining philosophers problem. 
> - It offers 3 different solutions: with monitors, with reentrant locks and with semaphores

I think 13 minutes per sample is a bit too much. I think we can cut down the time significantly by only assuming 3 philosophers, not 4.

I also believe that the sample should actually demonstrate several **architectural** solutions: resource hierarchy, arbitrator, etc. See Wikipedia entry for the possible solutions. Doing the same resource hierarchy solution with different styles of locks does not serve a purpose for this sample, I think.

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

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