Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An Effective Scheduling Algorithm for Homogeneous 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

4 Author(s)
Yipeng Zhou ; Dept. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Anhui ; Guangzhong Sun ; Yunlian Jiang ; Yinlong Xu

Efficient application scheduling is critical for achieving high performance in homogeneous computing environment. The application scheduling problem has been shown to be NP-complete. However, because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literatures. In this paper we present a novel algorithm based on list-scheduling and task-duplication on a bounded number of fully connected homogeneous machines. The algorithm is called fast duplication based on earliest finish time (FDEFT). In order to provide a robust and unbiased comparison with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of Gaussian elimination, shows that our scheduling algorithm significantly outperform on average all other excellent algorithms

Published in:

Grid and Cooperative Computing, 2006. GCC 2006. Fifth International Conference

Date of Conference:

Oct. 2006