By Topic

Allocating Resource in Grid Workflow Based on State Prediction

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
$33 $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)
Jiong Yu ; Sch. of Inf. Sci. & Eng., Xinjiang Univ., Urumqi ; Guo-Zhong Tian ; Ling Cheng

To the workflow scheduling of DAG-based workflow in which time constraints are rigid, a new algorithm based on the model of resource state reliability was put forward. According to the requirement of the workflow execution time submitted by users, the algorithm found critical paths and obtained the probability for all resources being the idle state at the time when the task arrives by using Chapman-Kolmogorov backward equations, and then made the choice of the resource system scheme with the lowest expenditure under the certain credit level of the state reliability for the resource combination on the critical path in DAG. The simulation shows the validity of algorithm.

Published in:

Embedded and Ubiquitous Computing, 2008. EUC '08. IEEE/IFIP International Conference on  (Volume:2 )

Date of Conference:

17-20 Dec. 2008