By Topic

A Global Scheduling Algorithm Based on Dynamic Critical Path

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)
Xing Gu ; Coll. of Comput. Sci. & Technol., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China ; Qun Yang ; De-chang Pi ; He-yang Ke

Task scheduling algorithm, with which the tasks with precedence constraints are assigned to the proper processor, is vital for obtaining high performance in multiprocessors system. In this paper, we firstly analyzed three typical table-based algorithms, i.e. MCP algorithm, ETF algorithm and BDCP algorithm. It is showed these algorithms cannot guarantee that the critical tasks have the priority to schedule firstly. To solve this problem, we proposed a new global scheduling algorithm that based on dynamic critical path (GDCP). In GDCP algorithm, tasks on the critical path have the priority to be scheduled firstly in each scheduling step, and a global search strategy will be applied to select a suitable processor to execute each task, thus reduces the schedule length. The result of experiments shows that the proposed algorithm is better than other algorithms.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011