Stabilizing Mobile philosophers
Intervenant(s) : Maria GRADINARIU (UPMC)
We present a self-stabilizing solution to a new version of dining philosophers problem. We call this problem mobile philosophers because philosophers can move around a logical ring formed out of a dynamic neetwork. Our solution has several noteworthy properties: (a) it is asynchronous; (b) it is local; (c) it works for networks where both the number of philosophers and the number of resources are unknown; (d) it is self-stabilizing.