PARALLEL ALGORITHM FOR GRID RESOURCE ALLOCATION BASED ON NASH EQUILIBRIUM
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 users 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.
Nash equilibrium grid computing resource allocation economic model maximum entropy
CHUN-TIAN CHENG ZHI-JIE LI
Institute of Hydropower System & Hydroinformatics, Dalian University of Technology, Liaoning, Dalian Institute of Hydropower System & Hydroinformatics, Dalian University of Technology, Liaoning, Dalian
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
4383-4388
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）