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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andronikos, T., Koziris, N.: Optimal Scheduling for UET-UCT Grids Into Fixed Number of Processors. In: Proceedings of 8th Euromicro Workshop on Parallel and Distributed Processing, pp. 237–243. IEEE Press, Los Alamitos (2000)
Gao, Y., Rong, H., Huang, J.Z.: Adaptive grid job scheduling with genetic algorithms. Future Generation Computer Systems 21, 151–161 (2005)
Yao, W., Li, B., You, J.: Genetic Scheduling on Minimal Processing Elements in the Grid. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 465–476. Springer, Heidelberg (2002)
DiMartino, V., et al.: Scheduling in A Grid Computing Environment Using Genetic Algorithms. In: Parallel and Distributed Processing Symposium, Proceedings International IPDPS, pp. 235–239 (2002)
Xu, Z., Hou, X., Sun, J.: Ant Algorithm-based Task Scheduling in Grid Computing. Electrical and Computer Engineering (IEEE CCECE 2003) 2, 1107–1110 (2003)
Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic models for resource management and scheduling in grid computing. J. Concurrency Computation: Practice Experience 24, 1507–1542 (2002)
Maheswaran, R.T., Başar, T.: Nash equilibrium and decentralized negotiation in auctioning divisible resources. Group Decision and Negotiation 12, 361–395 (2003)
Kwok, Y.K., Song, S.S., Hwang, K.: Selfish grid computing: Game-Theoretic modeling and NAS performance results. In: Proceedings of CCGrid 2005, pp. 349–356 (2005)
Bredin, J., Kotz, D., Rus, D., Maheswaran, R.T., Imer, C., Basar, T.: Computational markets to regulate mobile-agent systems. Autonomous Agents and Multi-Agent Systems 6, 235–263 (2003)
Gibbons, R.: A Primer in Game Theory. Harvester Wheatsheaf, New York (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, L., Dai, G., Zhang, H., Ren, S. (2008). Guarantee the Victorious Probability of Grid Resources in the Competition for Finite Tasks. In: Wu, S., Yang, L.T., Xu, T.L. (eds) Advances in Grid and Pervasive Computing. GPC 2008. Lecture Notes in Computer Science, vol 5036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68083-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-68083-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68081-9
Online ISBN: 978-3-540-68083-3
eBook Packages: Computer ScienceComputer Science (R0)