Cart (Loading....) | Create Account
Close category search window

Parallel Algorithm for Grid Resource Allocation Based on Nash Equilibrium

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Chun-Tian Cheng ; Inst. of Hydropower Syst. & Hydroinformatics, Dalian Univ. of Technol. ; Zhi-Jie Li

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 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

Published in:

Machine Learning and Cybernetics, 2006 International Conference on

Date of Conference:

13-16 Aug. 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.