Title :
Explicit dynamic exclusion algorithm
Author :
Weidman, E.B. ; Page, I.P. ; Pervin, W.J.
Author_Institution :
Texas Univ., Richardson, TX, USA
Abstract :
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
Keywords :
distributed algorithms; resource allocation; Dining Philosophers Algorithm; distributed resource allocation; dynamic resources allocation; precedence graph; Access protocols; Computer science; Heuristic algorithms; Resource management; System recovery;
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
DOI :
10.1109/SPDP.1991.218286
