By Topic

Grid workflow scheduling based on time prediction of queuing theory

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

6 Author(s)
Guozhong Tian ; College of Computer Science and Technology, Beijing University of Technology, 100124 China ; Chuangbai Xiao ; Xiao Xu ; ChaoQin Gao
more authors

For the grid workflow of DAG with strict time limits, this paper puts forward a new algorithm based on the time prediction model of queuing theory. According to the requirements of workflow execution time submitted by users, this algorithm finds critical path first and then obtains the probability of actual execution time exceeding the limit time which was set by users using Little's law, and then selects the best candidate resources to execute the workflow task. The simulation results show the effectiveness of the algorithm.

Published in:

Information and Automation (ICIA), 2010 IEEE International Conference on

Date of Conference:

20-23 June 2010