A Hierarchical Multiprocessor Scheduling Framework for

Authors:
Jose L Pino;Shuvra S. Bhattacharyya;Edward A. Lee
Affiliations:
-;-;-
Venue:
A Hierarchical Multiprocessor Scheduling Framework for
Year:
1999

Citing 0
Cited 7

Exploiting coarse-grained task, data, and pipeline parallelism in stream programs

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
A dynamic-programming algorithm for reducing the energy consumption of pipelined system-level streaming applications

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
An open framework for rapid prototyping of signal processing applications

EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Compilation of stream programs for multicore processors that incorporate scratchpad memories

Proceedings of the Conference on Design, Automation and Test in Europe
Sponge: portable stream programming on graphics engines

Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Liveness evaluation of a cyclo-static DataFlow graph

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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