RFR: CODETOOLS-7903021: jcstress: Dining Philosophers problem sample [v3]

[Michael Mirwaldt]

> 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

Michael Mirwaldt has updated the pull request incrementally with two additional commits since the last revision:

 - added OneDinerFewer solution to ClassicProblem_01_DiningPhilosophers
 - improved ResourceHierarchy solution and added Arbitrator solution to ClassicProblem_01_DiningPhilosophers

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

Changes:
  - all: https://git.openjdk.java.net/jcstress/pull/93/files
  - new: https://git.openjdk.java.net/jcstress/pull/93/files/bc8fbadb..522f583c

Webrevs:
 - full: https://webrevs.openjdk.java.net/?repo=jcstress&pr=93&range=02
 - incr: https://webrevs.openjdk.java.net/?repo=jcstress&pr=93&range=01-02

  Stats: 117 lines in 1 file changed: 116 ins; 1 del; 0 mod
  Patch: https://git.openjdk.java.net/jcstress/pull/93.diff
  Fetch: git fetch https://git.openjdk.java.net/jcstress pull/93/head:pull/93

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