Toward a game-theoretic model of grid systems

Authors:
Maria Grazia Buscemi;Ugo Montanari;Sonia Taneja
Affiliations:
IMT Lucca Institute for Advanced Studies, Italy;Dipartimento di Informatica, University of Pisa, Italy;IMT Lucca Institute for Advanced Studies, Italy and Dipartimento di Informatica, University of Pisa, Italy and Istituto Nazionale di Fisica Nucleare, Sezione di Pisa, Italy
Venue:
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Year:
2010

Citing 6
Cited 1

The POPCORN market—an online market for computational resources

Proceedings of the first international conference on Information and computation economies
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
The Impact of Local Priority Policies on Grid Scheduling Performance and an Adaptive Policy-based Grid Scheduling Algorithm

HPCASIA '04 Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference
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
Fair Game-Theoretic Resource Management in Dedicated Grids

CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Two level job-scheduling strategies for a computational grid

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

A Game-Theoretic Analysis of Grid Job Scheduling

Journal of Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational Grid is a promising platform that provides a vast range of heterogeneous resources for high performance computing. To grasp the full advantage of Grid systems, efficient and effective resource management and Grid job scheduling are key requirements. Particularly, in resource management and job scheduling, conflicts may arise as Grid resources are usually owned by different organizations, which have different goals. In this paper, we study the job scheduling problem in Computational Grid by analyzing it using game theoretic approaches. We consider a hierarchical job scheduling model that is formulated as a repeated non-cooperative game among Grid sites, which may have selfish concerns. We exploit the concept of Nash equilibrium as a stable solution for our game which eventually is convenient for every player.