Throughput Analysis of Synchronous Data Flow Graphs
Authors:
- A.H. GhamarianAGA.H. Ghamarian
- M.C.W. GeilenMGM.C.W. Geilen
- S. StuijkSSS. Stuijk
- T. BastenTBT. Basten
- B.D. TheelenBTB.D. Theelen
- M.R. MousaviMMM.R. Mousavi
- A.J.M. MoonenAMA.J.M. Moonen
- M.J.G. BekooijMBM.J.G. Bekooij
Top Cited Papers
- 2 August 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 25-36
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Experimental analysis of the fastest optimum cycle ratio and mean algorithmsACM Transactions on Design Automation of Electronic Systems, 2004
- Task-level timing models for guaranteed performance in multiprocessor networks-on-chip2003
- Scheduling for optimum data memory compaction in block diagram oriented software synthesis2002
- Synthesis of Embedded Software from Synchronous Dataflow SpecificationsJournal of Signal Processing Systems, 1999
- Faster maximum and minimum mean cycle algorithms for system-performance analysisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998
- Rate-optimal schedule for multi-rate DSP computationsJournal of Signal Processing Systems, 1995
- Ergodicity and throughput bounds of Petri nets with unique consistent firing count vectorIEEE Transactions on Software Engineering, 1991
- Synchronous data flowProceedings of the IEEE, 1987
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Scheduling Parallel ComputationsJournal of the ACM, 1968