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

A Research about Independent Tasks Scheduling on Tree-Based Grid Computing Platforms

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

3 Author(s)
Li Jun ; Inst. of Comput. Sci., Wuhan Univ. of Technol., Wuhan, China ; Li Chunlin ; Li Qingqing

Task scheduling has been one of the hot and difficult problems in grid computing, it is a big challenge to design an efficient scheduling algorithm. This paper discusses the problem of independent tasks scheduling on tree-based grid computing platforms, a small heap tree (virtual resource tree) model was proposed and on the model we propose a tasks scheduling heuristic algorithm based-on linear programming. In this algorithm, we consider the computing power and bandwidth for each node in the model and assign task for each node in an integrated manner. The algorithm analysis shows the proposed algorithm is rational and effective.

Published in:

Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on

Date of Conference:

22-23 May 2010

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.