By Topic

A DAG-based partitioning-reconfiguring scheduling algorithm in network of workstations

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)
Jia-Xiang Zhou ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Wei-Min Zheng

Static task scheduling on a network of workstations (NOW) is known to be an NP-complete problem in a strong sense. Some heuristic algorithms have been proven to be suboptimal. This paper presents a heuristic algorithm, called the DAG (directed acyclic graph)-based partitioning and reconfiguring algorithm, which is fast and efficient in parallel task scheduling. The complexity of this algorithm is O[log/sup |V|//spl times/(|V|+|E|)]. It adopts recursion to implement the partitioning of a DAG and the reconfiguration of sub-graphs, then builds task clusters to carry out the task scheduling. At the same time, it even optimizes the number of processors to some degree, which has not been solved before. The performance has been observed in a representative example by contrasting it with other existing scheduling schemes in terms of several variable factors. The results show that this algorithm is worthwhile.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:1 )

Date of Conference:

14-17 May 2000