Dining Philosophers
Introduction
The dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. Here, I present my solutions (with proofs) to this problem.
The slides with pauses can be viewed here.
The slides without pauses can be viewed here.
The C implementation can be viewed here.
TeX-nical Details
This is the primary TeX file which is to be compiled to get the slides.
This is the BibTeX file containing the references used by me.