144 search results - page 7 / 29 » Throughput Analysis of Synchronous Data Flow Graphs |
MEMOCODE
2006
IEEE
14 years 1 months ago
2006
IEEE
Data flow models are used for specifying and analysing signal processing and streaming applications. However, traditional data flow models are either not capable of expressing t...
SCP
1998
13 years 7 months ago
1998
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
EMSOFT
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we propose a generalized clustering approach for static data flow subgraphs mapped onto individual processors in Multi-Processor System on Chips (MPSoCs). The goal ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
DEDS
2010
13 years 7 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...