Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at onlinesupport@ieee.org. We apologize for any inconvenience.
By Topic

A performance evaluation of list scheduling heuristics for task graphs without communication costs

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.

Proposes three new static scheduling algorithms for allocating task graphs without communication costs to fully connected multiprocessors. The proposed algorithms, called MCP/ABS, MCP/CLR and MCP/CLRR, are based on the well-known MCP (modified critical path) algorithm, and all of them have the same complexity of O(v2log v), where v is the number of nodes in the task graph. A global comparison of the proposed algorithms with three recently reported scheduling algorithms [ETF (earliest task first), HLFET (high level first with estimated time) and MCP] is carried out. The proposed algorithms generate similar or even better solutions than the previous algorithms in terms of the completion times of the resulting schedules using a prototype standard task graph set

Published in:

Parallel Processing, 2000. Proceedings. 2000 International Workshops on

Date of Conference:

2000