Concurrent/Distributed programming illustrated using the dining philosophers problem

  • Authors:

  • S. Krishnaprasad

  • Affiliations:

  • Mathematical, Computing, and Information Sciences, Jacksonville State University, Jacksonville, AL

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many paradigms and techniques of distributed computing and concurrent processing have matured and are popular. A quick and effective way to assimilate the basics of these principles is to illustrate them using a single but simple example, avoiding language-specific and tool-specific details and syntax. In this paper we consider the famous dining philosophers problem and indicate several solutions to it based on the various concurrent/distributed computing concepts.