Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs

Share/Save/Bookmark

Wiggers, Maarten H. and Bekooij, Marco J.G. and Smit, Gerard J.M. (2007) Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. In: 10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007, 20 april 2007, Nice, France (pp. pp. 11-22).

[img] PDF
Restricted to UT campus only
: Request a copy
201kB
Abstract:In order to obtain a cost-efficient solution, tasks share resources in a Multi-Processor System-on-Chip. In our architecture, shared resources are run-time scheduled. We show how the effects of Latency-Rate servers, which is a class of run-time schedulers, can be included in a dataflow model. The resulting dataflow model, which can have an arbitrary topology, enables us to provide guarantees on the temporal behaviour of the implementation. Traditionally, the end-to-end behaviour of multiple Latency-Rate servers has been analysed with Latency-Rate analysis, which is a Network Calculus. This paper bridges a gap between Network Calculi and dataflow analysis techniques, since we show that a class of run-time schedulers can now be included in dataflow models, or, from a Network Calculus perspective, that restrictions on the topology of graphs that include run-time scheduling can be removed.
Item Type:Conference or Workshop Item
Copyright:© 2007 ACM
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/61769
Official URL:http://doi.acm.org/10.1145/1269843.1269846
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 242180