Parallel Algorithm for Grid Resource Allocation Based on Nash Equilibrium
Published: Jan 1, 2006
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...
Paper Details
Title
Parallel Algorithm for Grid Resource Allocation Based on Nash Equilibrium
Published Date
Jan 1, 2006
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History