Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1269843.1269846 | Journal of Computer and System Sciences |
Keywords | Field | DocType |
multiple latency-rate server,dataflow analysis technique,run-time arbitration,run-time schedulers,run-time scheduling,dataflow model,network calculus,network calculus perspective,dataflow graph,network calculi,latency-rate analysis,latency-rate server | Graph,Architecture,Dataflow architecture,Computer science,Scheduling (computing),Parallel computing,Server,Real-time computing,Dataflow,Arbitration,Network calculus,Distributed computing | Conference |
Citations | PageRank | References |
40 | 1.31 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maarten H. Wiggers | 1 | 116 | 6.19 |
| marco j g bekooij | 2 | 161 | 9.00 |
| Gerard J. M. Smit | 3 | 888 | 89.18 |