By Topic

Parallel task scheduling using the order graph method

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)
Cato, G.R. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA ; Reeves, D.S.

This paper proposes a new approach for task scheduling of fully specified flow graphs (FSFG) on parallel processing systems. This new approach is based on the enumeration and manipulation of linear extensions identified from a FSFG. The objective is to obtain a multiprocessor schedule which meets a set of admissibility conditions (iteration period, number of processors, precedence, and non-preemption). Feedback and a system-wide iteration period for multiple input data streams are investigated. In addition, flexible models for communications and network topology are introduced to improve the reliability of generated multiprocessor schedules. The resulting order graph method for parallel task scheduling provides an effective, generalized mapping methodology for DSP multiprocessor systems

Published in:

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Date of Conference:

28-31 Mar 1995