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

Share/Save/Bookmark

Wiggers, Maarten and Bekooij, Marco and Smit, Gerard (2007) Modelling Run-­Time Arbitration by Latency-­Rate Servers in Dataflow Graphs. [Report]

[img]
Preview
PDF
238Kb
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:Report
Copyright:© 2007 University of Twente, Centre for Telematics and Information Technology
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66946
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 242157