DocumentCode
880018
Title
Fast algorithms for distributed resource allocation
Author
Page, Ivor ; Jacob, Tom ; Chern, Eric
Author_Institution
Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA
Volume
4
Issue
2
fYear
1993
fDate
2/1/1993 12:00:00 AM
Firstpage
188
Lastpage
197
Abstract
Two new algorithms for the distributed static resource allocation problem are presented. The first algorithm, which shows excellent average case behavior in simulation requires the 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 other known polynomial time algorithm. Both algorithms have polynomial message complexity
Keywords
computational complexity; distributed processing; resource allocation; average case behavior; distributed static resource allocation problem; global queue; polynomial message complexity; polynomial waiting time; simulation; Algorithm design and analysis; Automatic control; Computer science; Data communication; Jacobian matrices; Polynomials; Protection; Resource management; System recovery; Telecommunications;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.207594
Filename
207594
Link To Document