Wiggers, M.H. and Bekooij, M.J.G.
Latency-Rate servers & Dataflow models.
Technical Report TR-CTIT-06-59,
Centre for Telematics and Information Technology University of Twente, Enschede.
Full text available as:
In the signal processing domain, dataflow graphs   and their associated analysis techniques are a well-accepted modeling paradigm. The vertices of a dataflow graph
represent functionality and are called actors, while the edges model which actors communicate with each other. Traditionally, these actors have been scheduled in a static
order or in a fully static fashion  . However, for firm real-time applications, run-time scheduling is required if there are tasks, that operate on different streams and share the same resource, for which either the execution time or the execution rate is unknown or impractical to bound.
|Item Type:||Internal Report (Technical Report)|
|Research Group:||EWI-CAES: Computer Architecture for Embedded Systems|
|Research Program:||CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication|
|Research Project:||PASTA: modelling PArallel Systems for Timing Analysis|
|Deposited On:||26 October 2006|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item