By Topic

A dynamic grouping scheduling for heterogeneous Internet-centric metacomputing system

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

3 Author(s)
Chuanwen Chiang ; Dept. of Comput. Sci. & Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Chungnan Lee ; Mingjyh Chang

In this paper we propose a dynamic scheduling heuristic for allocating task graphs onto Internet-centric metacomputing systems. This proposed algorithm, which is called the Dynamic Grouping Scheduling (DGS), differs from conventional algorithms in three respects. First, DGS employs a dynamic task grouping strategy to determine task computational cast. Second, this algorithm estimates the competence of processors for unscheduled tasks at each scheduling step. Third, the proposed scheme takes the fluctuations of power weight for processors into consideration. Experimental results show that the proposed DGS performs better than the competing scheduling schemes under the effects of varying power weights of processors

Published in:

Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on

Date of Conference: