By Topic

A new list scheduling method based on structural properties of task graphs

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

3 Author(s)
Fujita, S. ; Fac. of Eng., Hiroshima Univ., Japan ; Nakagawa, T. ; Yamashita, M.

We propose a new list scheduling method for obtaining a quasi-optimal solution to the multiprocessor scheduling problem that has been recognized as a key problem for realizing parallelizing compilers. Our approach for achieving a nearly optimal performance is to take a linear combination of several characteristics to obtain a heuristic function instead of taking a lexicographical combination. The goodness of the resultant heuristics is evaluated by experiments

Published in:

Parallel and Distributed Systems: Workshops, Seventh International Conference on, 2000

Date of Conference:

Oct 2000