Resumo de A resource allocation approach to distributed time
An approximation algorithm is described which is suitable for decentralized load balancing in computer networks. It is intended that the algorithm should operate with the support of a suitable cooperation protocol. The algorithm is evaluated principally in relation to the schedule length criterion. Worst-case bounds on achievable schedule length ratios are derived.
