skip to main content
article
Free Access

Dining philosophers revisited

Published:01 August 1990Publication History
Skip Abstract Section

Abstract

In 1965 Dijkstra posed and solved the Dining Philosophers problem. Since then the problem has become a classic test case for concurrency mechnisms and an example often discussed in operating systems courses. Two theorems prove the correctness of seatings where all philosophers always prefer to pick up a fork with a particular hand first. This note shows the subtlety required to solve the problem by showing that a recently published solution is incorrect. A correct solution is provided.

References

  1. [1] Dijkstra, E.W. Cooperating Sequential Processes , Technical Report EWD-123, Technological University, Eindhoven, The Netherlands, 1965. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta Inf., 1(1971), 115- 138.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Hoare, C.A.R. Communicating Sequential Processes, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Holt, R.C. Concurrent Euclid, The UNIX* System, and TUNIS, Addison-Wesley, 1983.Google ScholarGoogle Scholar
  5. [5] Ringwood, G.A. Parlog86 and the Dining Logicians, Comm. ACM, Jan. 1988, 10-25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Tanenbaum, A.S. Operating Systems: Design and Implementation, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dining philosophers revisited

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGCSE Bulletin
    ACM SIGCSE Bulletin  Volume 22, Issue 3
    Sep. 1990
    66 pages
    ISSN:0097-8418
    DOI:10.1145/101085
    Issue’s Table of Contents

    Copyright © 1990 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 August 1990

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!