The Dining Philosophers in Ada 95

This paper presents several alternative Ada 95 solutions to the classical “Dining Philosophers” problem. These examples illustrate a number of new Ada 95 tasking features including protected types, entry barriers dependent on an entry family index, the requeue statement, and asynchronous transfer of control. The paper compares the approaches with respect to style, portability, and performance.

[1]  Michael B. Feldman,et al.  The portable dining philosophers: a movable feast of concurrency and software engineering , 1992, SIGCSE '92.

[2]  Alan Burns,et al.  Concurrent programming , 1980, Operating Systems Engineering.

[3]  S. Tucker Taft,et al.  Ada 95 Reference Manual , 1995, Lecture Notes in Computer Science.

[4]  Randal E. Bryant,et al.  Concurrent programming , 1980, Operating Systems Engineering.

[5]  Dewayne E. Perry,et al.  ADA for Experienced Programmers , 1983 .

[6]  Mordechai Ben-Ari,et al.  Principles of concurrent programming , 1982 .