By Topic

A scheduling algorithm aimed at time and cost for meta-tasks in grid computing using fuzzy applicability

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)
Hu Rong ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha ; Hu Zhigang

In this paper, a novel concept is proposed to express the matching degree between available resources and meta-tasks which uses weighted average fuzzy applicability. Furthermore, a new scheduling algorithm aimed at time and cost for meta-tasks in grid computing is designed on the basis of layered task scheduling model. The scheduling aim can be chosen according to user's requirement through setting different weights, for example, Time-Weight, Cost-Weight, etc. The comparison metric is the value of fuzzy applicability, and the optimum solution is the scheme which has the maximum. The experiment result shows that the algorithm can consider the factors of time and cost as a whole. It also ensures that, given the aim with different weights, the algorithm's performance is better than some existent heuristic algorithms

Published in:

High-Performance Computing in Asia-Pacific Region, 2005. Proceedings. Eighth International Conference on

Date of Conference:

1-1 July 2005