By Topic

A Trust Model-Based Task Scheduling Algorithm for Data-Intensive Application

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

2 Author(s)
Yujiex Xu ; Coll. of Inf. Sci. & Technol., Dalian Maritime Univ., Dalian, China ; Wenyu Qu

With the increase of data-intensive application, the amount of data that the task requires becomes much larger and the task scheduling performance is greatly affected by the data transfer overhead. In grid, establishing trust model is considered to be an important measure of improving the grid security. Therefore, considering the two problems above, this paper improves the Min-Min algorithm and proposes trust model-based Min-Min scheduling algorithm. This algorithm consists of three phases: data file selecting, task scheduling and data scheduling. Two salient features of this algorithm are: 1) in selecting task-required data files, it considers file server's trust degree and data transmission time, it selects the data file with bigger trust value and smaller data transmission time, 2) in data transmission time calculating and transmission path selecting, it adopts the shortest path algorithm-Dijkstra. The experiment results show that although this scheduling algorithm extends the task completion time, the success rate of task execution is apparently raised.

Published in:

Chinagrid Conference (ChinaGrid), 2011 Sixth Annual

Date of Conference:

22-23 Aug. 2011