Stabilizing mobile philosophers
We present a self-stabilizing solution to a new version of the dining philosophers problem. We call this problem mobile philosophers problem because the philosophers can move around a logical ring formed out of a dynamic network. (c) 2005 Elsevier B.V. All rights reserved.
self-stabilization dining philosophers dynamic network resource allocation algorithms distributed computing fault tolerance