The Community for Technology Leaders
2011 Second International Conference on Networking and Computing (2011)
Osaka, Japan
Nov. 30, 2011 to Dec. 2, 2011
ISBN: 978-0-7695-4569-1
pp: 200-206
ABSTRACT
We define the problem of multi-resource allocation, which is an extension of the dining philosophers problem. We apply this problem to systems where participants (here called clients) are unknown. We propose a solution for 2-resource allocation in static networks, then, explain how to modify our protocol to handle client dynamicity. Extend our solution to handle larger resource requests is let as a future work.
INDEX TERMS
distributed algorithms, resource allocation problems, system with unknown participant
CITATION

S. Devismes, A. K. Datta, M. Potop-Butucaru, F. Kawala and L. L. Larmore, "Multi-resource Allocation with Unknown Participants," 2011 Second International Conference on Networking and Computing(ICNC), Osaka, Japan, 2011, pp. 200-206.
doi:10.1109/ICNC.2011.37
96 ms
(Ver 3.3 (11022016))