Guarantee the victorious probability of grid resources in the competition for finite tasks

Authors:
Lei Yao;Guanzhong Dai;Huixiang Zhang;Shuai Ren
Affiliations:
College of Automatic, Northwestern Polytechnical University, Xi'an, China;College of Automatic, Northwestern Polytechnical University, Xi'an, China;College of Automatic, Northwestern Polytechnical University, Xi'an, China;College of Automatic, Northwestern Polytechnical University, Xi'an, China
Venue:
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Year:
2008

Citing 5
Cited 0

Computational Markets to Regulate Mobile-Agent Systems

Autonomous Agents and Multi-Agent Systems
Genetic Scheduling on Minimal Processing Elements in the Grid

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Selfish grid computing: game-theoretic modeling and NAS performance results

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Adaptive grid job scheduling with genetic algorithms

Future Generation Computer Systems
Optimal scheduling for UET-UCT grids into fixed number of processors

EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper establishes a resource-rich environment of the grid computing at first, and then put forward a new type of grid resource competition algorithm in the environment. There are plenty of idle resources that can complete the similar task in the resources-rich grid computing environment, hence how these resources can gain the maximum benefits are discussed here. This paper presents a Guarantee of Victorious Probability algorithm (GVP), which can predict the action of an adversary through historical information, and determine its action based on the forecast. This is the essence of the game theory and this algorithm. The results of experiments show that the resource using GVP can be close to their expectations of victorious probability compare with the other resource using the random algorithm. The game of two resources using GVP is also discussed and the final victorious probability remain at 0.5. In this paper, a more in-depth analysis of the phenomenon is made, and the Nash Equilibrium of two-resource game is also discussed.