By Topic

Ad Hoc grid task scheduling algorithm considering trust-demand

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

5 Author(s)
Wang Haobo ; Department of Computer Science, Wuhan University of Technology, Wuhan 430063, P.R. China ; Li Chunlin ; Yan Chunxiang ; Li Qingqing
more authors

At present, most Ad Hoc grid task scheduling algorithms ignore the impact of trust mechanism, resulting in the potential dangerous in the real scheduling. In this paper, the trust model is defined, which satisfies the tasks' trust demands, in order to choose the suitable resource node to be executed in the scheduling. Moreover, a task scheduling algorithm extended from Min-Min algorithm (T-Min-Min) is proposed. The proposed algorithm not only satisfies the trust demand of the user but also considers the resource nodes' energy consumption and load balancing. The simulation suggests that it can effectively shorten the task completion time and the number of failed tasks in the Ad Hoc grid.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

21-24 May 2010