29 search results - page 3 / 6 » Liveness and Boundedness of Synchronous Data Flow Graphs |
FMCAD
2008
Springer
13 years 7 months ago
2008
Springer
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
ISSS
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification in system level design. In the presented design methodology, each node of a data flow gra...
SAC
2010
ACM
13 years 10 months ago
2010
ACM
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
JSA
2006
13 years 5 months ago
2006
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...
ASPDAC
2011
ACM
12 years 9 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...