A Hierarchical Multiprocessor Scheduling System for DSP Applications

Authors:
Jose Luis Pino;Edward A. Lee;Shuvra S. Bhattacharyya
Affiliations:
-;-;-
Venue:
ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)
Year:
1995

Citing 0
Cited 9

Hierarchical coarse-grained stream compilation for software defined radio

CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
Parametric throughput analysis of synchronous data flow graphs

Proceedings of the conference on Design, automation and test in Europe
A generalized static data flow clustering algorithm for mpsoc scheduling of multimedia applications

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Stream Compilation for Real-Time Embedded Multicore Systems

Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
Analysis of SystemC actor networks for efficient synthesis

ACM Transactions on Embedded Computing Systems (TECS)
Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

Journal of Signal Processing Systems
Mapping Parameterized Cyclo-static Dataflow Graphs onto Configurable Hardware

Journal of Signal Processing Systems
Compositional temporal analysis model for incremental hard real-time system design

Proceedings of the tenth ACM international conference on Embedded software
A rule-based quasi-static scheduling approach for static islands in dynamic dataflow graphs

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses a hierarchical scheduling framework which reduces the complexity of scheduling synchronous datajow (SDF) graphs onto multiple processors. The core of this framework is a clustering algorithm that decreases the number of nodes before expanding the SDF graph into a precedence directed acyclic graph (DAG). The internals of the clusters are then scheduled with uniprocessor SDF schedulers which can optimize for memory usage. The clusten' ng is done in such a manner as to leave ample parallelism exposed for the multiprocessor scheduler. We have developed the SDF composition theorem for testing if a clustering step is valid. The advantages of this framework are demonstrated with several practical, real-time examples.