87 search results - page 1 / 18 » Latency Minimization for Synchronous Data Flow Graphs |
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...
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...
DATE
2009
IEEE
13 years 12 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
DAC
1994
ACM
13 years 9 months ago
1994
ACM
GLVLSI
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...