By Topic

Scheduling and task allocation for parallel digital signal processing architectures

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)
Konstantinides, K. ; Hewlett-Packard Lab., Palo Alto, CA, USA ; Kaneshiro, R.T. ; Tani, J.R.

The authors present models and techniques for the task and I/O allocation and scheduling problem, subject to task precedence, memory requirements, and interprocessor communication costs. The models take into account the special characteristics of new architectures and can handle both sequential and parallel I/O and program execution within a processor. Both linear and nonlinear memory requirements can be modeled. By distinguishing between tasks that require all the output data from a predecessor before they begin execution and tasks that require only partial data, the models are more realistic and the accuracy and efficiency of the schedules is further improved. A simple branch-and-bound technique is presented, and it is applied to the solution of the task allocation problem. An example from the scheduling of a measurement application that includes filtering and FFT operations is also presented

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989