EEMCS

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF 239 Kb

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.

Available Versions of this Item

• Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs (deposited 21 September 2007)
  [Currently Displayed]
  • Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs (deposited 21 September 2007)

Export this item as:

• BibTeX
• XML

To correct this item please ask your editor

Repository Staff Only: edit this item