Authors: V C Barbosa M R F Benevides F M G França
Publish Date: 2001/01/01
Volume: 34, Issue: 1, Pages: 13-26
Abstract
We introduce DPPr for ``Dining Philosophers Problem with rates as a generalization of the heavyload case of the Dining Philosophers Problem DPP In DPPr processes are required to be scheduled to access shared resources with prespecified relative frequencies DPPr is an abstraction of resourcesharing problems to which the synchronization of some distributed algorithms for neuralnetwork models and the generation of timing signals in asynchronous digital circuits are related Two fully distributed synchronous solutions are given for DPPr in this paper The first solution employs a reduction to heavyload DPP and after that a distributed scheduling mechanism that has been used to solve this problem with optimal concurrency The second solution tackles the DPPr instance directly by operating on a multigraph based on that instance We conclude by indicating how the two synchronous solutions carry over to the asynchronous case
Keywords: