RFR: Classic problem 01 dining philosophers

[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

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

Commit messages:
 - added initial draft of ClassicProblem_01_DiningPhilosophers for a PR
 - Merge branch 'openjdk:master' into master
 - Merge branch 'openjdk:master' into master
 - Merge branch 'openjdk:master' into master
 - Merge remote-tracking branch 'origin/master'
 - Merge remote-tracking branch 'origin/master'
 - Next try to fix user name of author
 - 5 more samples for mutex algorithms
 - Changed user name and email
 - Merge branch 'openjdk:master' into master
 - ... and 2 more: https://git.openjdk.java.net/jcstress/compare/d8e24b86...714aa984

Changes: https://git.openjdk.java.net/jcstress/pull/93/files
 Webrev: https://webrevs.openjdk.java.net/?repo=jcstress&pr=93&range=00
  Stats: 242 lines in 1 file changed: 242 ins; 0 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