Algorithmic Mechanism Design for Load Balancing in Distributed Systems

Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. These agents may manipulate the resource allocation algorithm in their own benefit and their selfish behavior may lead to severe performance degradation and poor efficiency. In this paper we investigate the problem of designing protocols for resource allocation involving selfish agents. Solving this kind of problems is the object of mechanism design theory. Using this theory we design a truthful mechanism for solving the static load balancing problem in heterogeneous distributed systems. We prove that using the optimal allocation algorithm the output function admits a truthful payment scheme satisfying voluntary participation. We derive a protocol that implements our mechanism and present experiments to show its effectiveness.

• Type: Conference
• Year: 2002
• Where: CLUSTER
• Authors: Daniel Grosu, Anthony T. Chronopoulos
• Keywords: Allocation Algorithm, CLUSTER 2002, Distributed And Parallel Computing, Resource Allocation, Resource Allocation Algorithm