Modelling run-time arbitration by latency-rate servers in dataflow graphs

  • Authors:
  • Maarten H. Wiggers;Marco J. G. Bekooij;Gerard J. M. Smit

  • Affiliations:
  • University of Twente, Enschede, The Netherlands;NXP Semiconductors, Eindhoven, The Netherlands;University of Twente, Enschede, The Netherlands

  • Venue:
  • SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.