3 search results - page 1 / 1 » Scheduling Optimisations for SPIN to Minimise Buffer Require... |
FMCAD
2008
Springer
13 years 6 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...
DAC
1997
ACM
13 years 8 months ago
1997
ACM
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...
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...