By Topic

A multiprocessor scheduling heuristic for functional parallelism and its performance measure

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)
Li, D. ; Nagoya Inst. of Technol., Japan ; Mizuno, A. ; Iwahori, Y. ; Ishii, N.

This paper addresses the following scheduling problem: given a precedence graph with communication costs and a machine architecture with different types of processors, construct a schedule that runs on the given architecture at the minimum possible execution time. The main contributions are: Firstly, we present a static scheduling algorithm that keeps processors idle for future important tasks and fills idle time slots incurred due to interprocessor communication. Secondly, to evaluate the effectiveness of the algorithm, we develop a lower bound on the length of a optimal schedule as a yardstick. Experiments show that this new approach produces better schedules and takes much less compile time

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997