By Topic

Scalable duplication strategy with bounded availability of processors

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

4 Author(s)
Guodong Li ; Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA ; Youtao Zhang ; Yongjin Lin ; Yaochun Huang

In this paper we present a task selection scheme and a list-scheduling algorithm for scheduling DAGs onto homogeneous/heterogeneous systems with bounded availability of processors. Specifically, forbidden duplications and superfluous duplications are eliminated in the task selection phase and the processor selection phase respectively. Simulation results show that the proposed algorithm outperforms other high performance algorithms when the availability of processors is restrained.

Published in:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

Date of Conference:

7-9 July 2004