Multi-resource allocation with unknown participants
2nd International Conference on Networking and Computing
First page number:
Last page number:
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.
Datta, A. K.,
Larmore, L. L.,
Multi-resource allocation with unknown participants.
2nd International Conference on Networking and Computing, 2011