n-Philosophers: An Exercise in Distributed Control

@article{Chang1980nPhilosophersAE,
  title={n-Philosophers: An Exercise in Distributed Control},
  author={Ernest J. H. Chang},
  journal={Computer Networks},
  year={1980},
  volume={4},
  pages={71-76}
}
The n-philosophers problem is an example of asynchronous processes which interact. We assume an environment in which philosophers become hungry at arbitrary intervals, and the use of global mechanisms such as semaphores or shared memory is disallowed. Instead, a message-passing mechanism is used to detect the presence of deadlock among the philosophers. Some alternative ways in which deadlock can be resolved are derived from differences in the way philosophers might relinquish their resources… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

On starvation prevention

  • P. J. Courtois, J. Georges
  • RAIRO lnformatique Computer Science,
  • 1977
1 Excerpt

A class of decentralized mechanism for mutual exclusion in distributed systems

  • E. J. H. Chang
  • Working Paper

Similar Papers

Loading similar papers…