80 search results - page 1 / 16 » Throughput Constraint for Synchronous Data Flow Graphs |
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
DSD
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
ASPDAC
2011
ACM
12 years 8 months ago
2011
ACM
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
ACSD
2006
IEEE
13 years 11 months ago
2006
IEEE
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...