By Topic

A comparison of the static task graph scheduling algorithms

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)
Brest, J. ; Fac. of Electr. Eng. & Comput. Sci., Maribor Univ., Slovenia ; Zumer, V.

In this paper the new algorithm for static task graph scheduling on multiprocessor systems is proposed and a comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a prototype standard task graph set.

Published in:

Information Technology Interfaces, 2001. ITI 2001. Proceedings of the 23rd International Conference on

Date of Conference:

19-22 June 2001