On the generalized dining philosophers problem

Details On the generalized dining philosophers problem On the generalized dining philosophers problem

2001-09-03

arxiv.org/abs/cs/0109003v1

Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 81-89, ACM, 2001

Computer Science

Programming Languages

Scientific paper

We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We show that the well-known algorithms of Lehmann and Rabin do not work in the generalized case, and we propose an alternative algorithm based on the idea of letting the philosophers assign a random priority to their adjacent forks.

Affiliated with

Also associated with

No associations

Rating

On the generalized dining philosophers problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the generalized dining philosophers problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the generalized dining philosophers problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354687