Latency-Rate servers & Dataflow models


Wiggers, Maarten and Bekooij, Marco (2006) Latency-Rate servers & Dataflow models. [Report]

open access
Abstract:In the signal processing domain, dataflow graphs [2] [10] 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 [9] [16]. 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:Report
Copyright:© 2006 University of Twente, Centre for Telematics and Information Technology
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 238678