The Community for Technology Leaders
Green Image
Issue No. 02 - February (1993 vol. 4)
ISSN: 1045-9219
pp: 188-197
<p>Two new algorithms for the distributed static resource allocation problem are presented.The first algorithm, which shows excellent average case behavior in simulation requiresthe maintenance of a global queue. The second, which needs only local communication,has polynomial waiting time and exhibits better average case behavior than the only otherknown polynomial time algorithm. Both algorithms have polynomial message complexity.</p>
Index Termsdistributed static resource allocation problem; average case behavior; simulation; globalqueue; polynomial waiting time; polynomial message complexity; computationalcomplexity; distributed processing; resource allocation
I. Page, T. Jacob, E. Chern, "Fast Algorithms for Distributed Resource Allocation", IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 188-197, February 1993, doi:10.1109/71.207594
91 ms
(Ver 3.3 (11022016))