Title :
Parallel Algorithm for Grid Resource Allocation Based on Nash Equilibrium
Author :
Cheng, Chun-Tian ; Li, Zhi-Jie
Author_Institution :
Inst. of Hydropower Syst. & Hydroinformatics, Dalian Univ. of Technol.
Abstract :
This paper presents a proportional sharing resource allocation strategy based on Nash equilibrium in grid computing. Given perfect information, the problem of resource allocation can be formulated as a multi-player game with the players being users purchasing computational service from a common resource. A computable Nash equilibrium for parallel tasks is derived to determine a grid user´s bidding strategy. In particular, by introducing maximum entropy method, the initial Nash equilibrium problem can be converted into a differentiable optimal problem. The performance evaluation of the proposed Nash-based strategy is carried out under different configurations. The analytical and simulated results indicate that the Nash-based strategy is efficient, and has better performance than round-robin allocation
Keywords :
game theory; grid computing; maximum entropy methods; optimisation; parallel algorithms; resource allocation; computable Nash equilibrium; differentiable optimal problem; grid computing; maximum entropy method; multiplayer game; parallel algorithm; resource allocation; round-robin allocation; Computer science; Concurrent computing; Cybernetics; Distributed computing; Entropy; Environmental economics; Game theory; Grid computing; Machine learning; Nash equilibrium; Parallel algorithms; Resource management; Nash equilibrium; economic model; grid computing; maximum entropy; resource allocation;
Conference_Titel :
Machine Learning and Cybernetics, 2006 International Conference on
Conference_Location :
Dalian, China
Print_ISBN :
1-4244-0061-9
DOI :
10.1109/ICMLC.2006.259089