Explicit dynamic exclusion algorithm
Elizabeth Baldwin Weidman, I. P. Page, William J. Pervin · 2002
An algorithm for the distributed (explicitly) dynamic resources allocation problem is presented. The algorithm is based on Chandy and Misra's Dining Philosophers Algorithm. Their algorithm is extended to allow philosophers to request that they be added or deleted from the problem. Philosophers are also allowed to add and delete resources from their set of needed resources. This solution can also be viewed as a solution to the Drinking Philospher's Problem.>