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

M.H. Wiggers; Marco Jan Gerrit Bekooij; Marco J.G. Bekooij; Gerardus Johannes Maria Smit

doi:10.1145/1269843.1269846

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

M.H. Wiggers, Marco Jan Gerrit Bekooij, Marco J.G. Bekooij, Gerardus Johannes Maria Smit

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

26 Downloads (Pure)

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.

Original language	English
Title of host publication	Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES)
Editors	H. Falk, P. Marwedel
Place of Publication	New York
Publisher	ACM Press
Pages	11-22
Number of pages	12
DOIs	https://doi.org/10.1145/1269843.1269846
Publication status	Published - 20 Apr 2007
Event	10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007 - Acropolis, Nice, France Duration: 20 Apr 2007 → 20 Apr 2007 Conference number: 10 http://www.scopesconf.org/scopes-07/

Publication series

Name	ACM International Conference Proceeding Series
Publisher	ACM Press
Number	P2773
Volume	235

Workshop

Workshop	10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007
Abbreviated title	SCOPES
Country/Territory	France
City	Nice
Period	20/04/07 → 20/04/07
Internet address	http://www.scopesconf.org/scopes-07/

Keywords

EWI-10367
METIS-242180
IR-61769
CAES-EEA: Efficient Embedded Architectures

Access to Document

10.1145/1269843.1269846

Cite this

Wiggers, M. H., Bekooij, M. J. G., Bekooij, M. J. G., & Smit, G. J. M. (2007). Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. In H. Falk, & P. Marwedel (Eds.), Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES) (pp. 11-22). (ACM International Conference Proceeding Series; Vol. 235, No. P2773). ACM Press. https://doi.org/10.1145/1269843.1269846

Wiggers, M.H. ; Bekooij, Marco Jan Gerrit ; Bekooij, Marco J.G. et al. / Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES). editor / H. Falk ; P. Marwedel. New York : ACM Press, 2007. pp. 11-22 (ACM International Conference Proceeding Series; P2773).

@inproceedings{c8a3a80d435245babae6edeb6a0e3fb7,

title = "Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs",

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.",

keywords = "EWI-10367, METIS-242180, IR-61769, CAES-EEA: Efficient Embedded Architectures",

author = "M.H. Wiggers and Bekooij, {Marco Jan Gerrit} and Bekooij, {Marco J.G.} and Smit, {Gerardus Johannes Maria}",

year = "2007",

month = apr,

day = "20",

doi = "10.1145/1269843.1269846",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "ACM Press",

number = "P2773",

pages = "11--22",

editor = "H. Falk and P. Marwedel",

booktitle = "Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES)",

note = "10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007, SCOPES ; Conference date: 20-04-2007 Through 20-04-2007",

url = "http://www.scopesconf.org/scopes-07/",

}

Wiggers, MH, Bekooij, MJG, Bekooij, MJG & Smit, GJM 2007, Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. in H Falk & P Marwedel (eds), Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES). ACM International Conference Proceeding Series, no. P2773, vol. 235, ACM Press, New York, pp. 11-22, 10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007, Nice, France, 20/04/07. https://doi.org/10.1145/1269843.1269846

Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. / Wiggers, M.H.; Bekooij, Marco Jan Gerrit; Bekooij, Marco J.G. et al.
Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES). ed. / H. Falk; P. Marwedel. New York: ACM Press, 2007. p. 11-22 (ACM International Conference Proceeding Series; Vol. 235, No. P2773).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Wiggers, M.H.

AU - Bekooij, Marco Jan Gerrit

AU - Bekooij, Marco J.G.

AU - Smit, Gerardus Johannes Maria

N1 - Conference code: 10

PY - 2007/4/20

Y1 - 2007/4/20

N2 - 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.

AB - 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.

KW - EWI-10367

KW - METIS-242180

KW - IR-61769

KW - CAES-EEA: Efficient Embedded Architectures

U2 - 10.1145/1269843.1269846

DO - 10.1145/1269843.1269846

M3 - Conference contribution

T3 - ACM International Conference Proceeding Series

SP - 11

EP - 22

BT - Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES)

A2 - Falk, H.

A2 - Marwedel, P.

PB - ACM Press

CY - New York

T2 - 10th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2007

Y2 - 20 April 2007 through 20 April 2007

ER -

Wiggers MH, Bekooij MJG, Bekooij MJG, Smit GJM. Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. In Falk H, Marwedel P, editors, Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES). New York: ACM Press. 2007. p. 11-22. (ACM International Conference Proceeding Series; P2773). doi: 10.1145/1269843.1269846

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

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this