Sciweavers

21 search results - page 2 / 5
» On Retiming Synchronous Data-Flow Graphs
Sort
View
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
13 years 12 months ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...
DAC
1997
ACM
13 years 10 months ago
Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
Marleen Adé, Rudy Lauwereins, J. A. Peperst...
DATE
2008
IEEE
131views Hardware» more  DATE 2008»
14 years 7 days ago
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...
DSD
2007
IEEE
120views Hardware» more  DSD 2007»
14 years 3 days ago
Latency Minimization for Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
Amir Hossein Ghamarian, Sander Stuijk, Twan Basten...
CPAIOR
2009
Springer
14 years 10 days ago
Throughput Constraint for Synchronous Data Flow Graphs
Alessio Bonfietti, Michele Lombardi, Michela Milan...