By Topic

BMQOS: A General Self-Adaptive Global Resource Scheduling Algorithm for Computational Grid

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Liu Liang ; Sch. of Comput., Northwestern Polytech. Univ., Xi''an ; Zhou Xing-she ; Liu Qiu-rang ; Wang Tao
more authors

The process of computational grid resource scheduling generally falls into two phases: global resource scheduling and local resource scheduling. Under this pattern, global resource scheduling algorithms are different from the traditional resource scheduling algorithms of LRMSs (local resource management system, LRMS). In this paper, a general self- adaptive global resource scheduling algorithm for Computational Grid, BMQOS (Best Multi QOS) is presented. According to the personal resource requirement of a computational grid job, BMQOS globally selfadaptively weighs every index of the MQOS of candidate computational grid nodes and chooses an appropriate node for a job from the candidates finally. Applied in NPU Campus Computational Grid, this algorithm achieves good effect.

Published in:

Semantics, Knowledge and Grid, 2005. SKG '05. First International Conference on

Date of Conference:

27-29 Nov. 2005