EE382C Embedded Software Systems
Lecture 18: Multiprocessor SDF Scheduling
Announcements
- On April 11, 2000, the
EDN Embedded Benchmark Microprocessor
Consortium (EEMBC) will release certified microprocessor benchmark
scores for a wide range of data-intensive and control-intensive tasks
on a wide range of processors.
The tasks are from networking, telecommunications, automotive, industrial,
office automation, and consumer product applications.
EEMBC is a consortium of 37 Microprocessor, DSP, and Compiler
vendors.
SDF Multiprocessor Scheduling
- Introduction to code optimization
- Blocked SDF multiprocessor scheduling
- Jose Luis Pino, Shuvra S. Bhattacharyya, and Edward A. Lee,
"A Hierarchical Multiprocessor Scheduling System for DSP
Applications",
Proc. IEEE Asilomar Conference on Signals, Systems, and Computers,
Nov. 1995.
- paper (handout) and slides
- SDF Composition Theorem to detect when clustering introduces
deadlock in either the SDF graph or in the associated Directed Ayclic
Precedence Graph
- advantages of hierarchical scheduling: reduces complexity and
allows heterogeneous schedulers and targets to be used
- Jose Luis Pino, Shuvra S. Bhattacharyya, and Edward A. Lee,
"A Hierarchical Multiprocessor Scheduling Framework for Synchronous
Dataflow Graphs",
Technical Report, UCB/ERL M95/36, May 30, 1995.
Updated 04/06/00.