Modelling run-time arbitration by latency-rate servers in dataflow graphs
Maarten H. Wiggers, Marco J.G. Bekooij, Gerard J.M. Smit · 2007
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.