Minimising buffer requirements of synchronous dataflow graphs with model checking
Authors:
- M. GeilenMGM. Geilen
- T. BastenTBT. Basten
- S. StuijkSSS. Stuijk
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 819-824
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Data Memory Minimisation For Synchronous Data Flow Graphs Emulated On DSP-FPGA Targets2005
- Task-level timing models for guaranteed performance in multiprocessor networks-on-chip2003
- Managing memory requirements in the synthesis of real-time systems from processing graphs2002
- A model checking approach to evaluating system level dynamic power management policies for embedded systems2002
- Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow NetworksJournal of Signal Processing Systems, 2002
- Synthesis of Embedded Software from Synchronous Dataflow SpecificationsJournal of Signal Processing Systems, 1999
- Scheduling dynamic dataflow graphs with bounded memory using the token flow model1993
- Synchronous data flowProceedings of the IEEE, 1987