By Topic

Grid Schedule Algorithm Based on Load with Trust-Driven Mechanism

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

4 Author(s)
Xingyao Yang ; Coll. of Inf. Sci. & Eng., Xinjiang Univ., Urumqi, China ; Jiong Yu ; Bin Liao ; Feiran Yu

With the trust-driven mechanism, associating trust model, benefit function with current load, a new task scheduling algorithm TD_Load based on load balance is presented for computing grid. Under the condition of the best trust benefit value, the scheduling chooses resources by MCT computed in advance. Under the same conditions, experimental results show that TD_Load algorithm is better than traditional algorithms based on benefit values only, and the cost isn't much, so the total schedule performance is excellent, especially when the number of tasks increases.

Published in:

Chinagrid Conference (ChinaGrid), 2011 Sixth Annual

Date of Conference:

22-23 Aug. 2011