The effect of operation scheduling on the performance of a data flow computer
IEEE Transactions on Computers
TDFL: a task-level dataflow language
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Compile-Time Scheduling and Assignment of Data-Flow Program Graphs with Data-Dependent Iteration
IEEE Transactions on Computers
Multiprocessor scheduling to account for interprocessor communication
Multiprocessor scheduling to account for interprocessor communication
Compile-time scheduling of dataflow program graphs with dynamic constructs
Compile-time scheduling of dataflow program graphs with dynamic constructs
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Hierarchical Compilation of Macro Dataflow Graphs for Multiprocessors with Local Memory
IEEE Transactions on Parallel and Distributed Systems
Representation of process mode correlation for scheduling
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Scheduling hardware/software systems using symbolic techniques
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Dynamic Reconfiguration to Support Concurrent Applications
IEEE Transactions on Computers
FunState—an internal design representation for codesign
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
A dataflow specification for system level synthesis of 3D graphics applications
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
System canvas: a new design environment for embedded DSP and telecommunication systems
Proceedings of the ninth international symposium on Hardware/software codesign
Analysis of quasi-static scheduling techniques in a virtualized reconfigurable machine
FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
Data Driven Graph: A Parallel Program Model for Scheduling
LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
Dynamic Memory Oriented Transformations in the MPEG4 IM1-Player on a Low Power Platform
PACS '00 Proceedings of the First International Workshop on Power-Aware Computer Systems-Revised Papers
Providing time- and space- efficient procedure calls for asynchronous software thread integration
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Teleport messaging for distributed stream programs
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
ACM Transactions on Embedded Computing Systems (TECS)
SoCDAL: System-on-chip design AcceLerator
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Reconfigurable hardware solution to parallel prefix computation
The Journal of Supercomputing
Parallel programming with data driven model
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Port Based Actor Model with Kahn Process Network Model and Decidable Dataflow Model
Journal of Signal Processing Systems
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Hi-index | 14.98 |
Scheduling dataflow graphs onto processors consists of assigning actors to processors, ordering their execution within the processors, and specifying their firing time. While all scheduling decisions can be made at runtime, the overhead is excessive for most real systems. To reduce this overhead, compile-time decisions can be made for assigning and/or ordering actors on processors. Compile-time decisions are based on known profiles available for each actor at compile time. The profile of an actor is the information necessary for scheduling, such as the execution time and the communication patterns. However, a dynamic construct within a macro actor, such as a conditional and a data-dependent iteration, makes the profile of the actor unpredictable at compile time. For those constructs, we propose to assume some profile at compile-time and define a cost to be minimized when deciding on the profile under the assumption that the runtime statistics are available at compile-time. Our decisions on the profiles of dynamic constructs are shown to be optimal under some bold assumptions, and expected to be near-optimal in most cases. The proposed scheduling technique has been implemented as one of the rapid prototyping facilities in Ptolemy. This paper presents the preliminary results on the performance with synthetic examples.