Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure

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

doi:10.1109/RTAS.2007.12

Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure

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

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

29 Citations (Scopus)

215 Downloads (Pure)

Abstract

This paper describes a conservative approximation algorithm that derives close to minimal buffer capacities for an application described as a cyclo-static dataflow graph. The resulting buffer capacities satisfy constraints on the maximum buffer capacities and end-to-end throughput and latency constraints. Furthermore we show that the effects of run-time arbitration can be included in the response times of dataflow actors. We show that modelling an MP3 playback application as a cyclo-static dataflow graph instead of a multi-rate dataflow graph results in buffer capacities that are reduced up to 39%. Furthermore, the algorithm is applied to a real-life car-radio application, in which two independent streams are processed.

Original language	Undefined
Title of host publication	Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07
Place of Publication	Los Alamitos, CA, United States
Publisher	IEEE
Pages	281-292
Number of pages	12
ISBN (Print)	0-7695-2800-7
DOIs	https://doi.org/10.1109/RTAS.2007.12
Publication status	Published - Apr 2007
Event	13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2007 - Seattle, WA, United States, Seattle, United States Duration: 3 Apr 2007 → 6 Apr 2007 Conference number: 13

Publication series

Name
Publisher	IEEE Computer Society
Number	07TH8938
ISSN (Print)	1080-1812

Conference

Conference	13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2007
Abbreviated title	RTAS 2007
Country/Territory	United States
City	Seattle
Period	3/04/07 → 6/04/07

Keywords

METIS-242168
IR-67100
EWI-9806
CAES-EEA: Efficient Embedded Architectures

Access to Document

10.1109/RTAS.2007.12

Cite this

Wiggers, M. H., Bekooij, M. J. G., Bekooij, M. J. G., Jansen, P. G., & Smit, G. J. M. (2007). Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure. In Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07 (pp. 281-292). Article 10.1109/RTAS.2007.12 IEEE. https://doi.org/10.1109/RTAS.2007.12

@inproceedings{6fed5cece07e4688a21e858c6181f886,

title = "Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure",

abstract = "This paper describes a conservative approximation algorithm that derives close to minimal buffer capacities for an application described as a cyclo-static dataflow graph. The resulting buffer capacities satisfy constraints on the maximum buffer capacities and end-to-end throughput and latency constraints. Furthermore we show that the effects of run-time arbitration can be included in the response times of dataflow actors. We show that modelling an MP3 playback application as a cyclo-static dataflow graph instead of a multi-rate dataflow graph results in buffer capacities that are reduced up to 39%. Furthermore, the algorithm is applied to a real-life car-radio application, in which two independent streams are processed.",

keywords = "METIS-242168, IR-67100, EWI-9806, CAES-EEA: Efficient Embedded Architectures",

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

note = "10.1109/RTAS.2007.12 ; 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2007 ; Conference date: 03-04-2007 Through 06-04-2007",

year = "2007",

month = apr,

doi = "10.1109/RTAS.2007.12",

language = "Undefined",

isbn = "0-7695-2800-7",

publisher = "IEEE",

number = "07TH8938",

pages = "281--292",

booktitle = "Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07",

address = "United States",

}

Wiggers, MH, Bekooij, MJG, Bekooij, MJG, Jansen, PG & Smit, GJM 2007, Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure. in Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07., 10.1109/RTAS.2007.12, IEEE, Los Alamitos, CA, United States, pp. 281-292, 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2007, Seattle, Washington, United States, 3/04/07. https://doi.org/10.1109/RTAS.2007.12

Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure. / Wiggers, M.H.; Bekooij, Marco J.G.; Bekooij, Marco Jan Gerrit et al.
Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07. Los Alamitos, CA, United States: IEEE, 2007. p. 281-292 10.1109/RTAS.2007.12.

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

TY - GEN

T1 - Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure

AU - Wiggers, M.H.

AU - Bekooij, Marco J.G.

AU - Bekooij, Marco Jan Gerrit

AU - Jansen, P.G.

AU - Smit, Gerardus Johannes Maria

N1 - Conference code: 13

PY - 2007/4

Y1 - 2007/4

N2 - This paper describes a conservative approximation algorithm that derives close to minimal buffer capacities for an application described as a cyclo-static dataflow graph. The resulting buffer capacities satisfy constraints on the maximum buffer capacities and end-to-end throughput and latency constraints. Furthermore we show that the effects of run-time arbitration can be included in the response times of dataflow actors. We show that modelling an MP3 playback application as a cyclo-static dataflow graph instead of a multi-rate dataflow graph results in buffer capacities that are reduced up to 39%. Furthermore, the algorithm is applied to a real-life car-radio application, in which two independent streams are processed.

AB - This paper describes a conservative approximation algorithm that derives close to minimal buffer capacities for an application described as a cyclo-static dataflow graph. The resulting buffer capacities satisfy constraints on the maximum buffer capacities and end-to-end throughput and latency constraints. Furthermore we show that the effects of run-time arbitration can be included in the response times of dataflow actors. We show that modelling an MP3 playback application as a cyclo-static dataflow graph instead of a multi-rate dataflow graph results in buffer capacities that are reduced up to 39%. Furthermore, the algorithm is applied to a real-life car-radio application, in which two independent streams are processed.

KW - METIS-242168

KW - IR-67100

KW - EWI-9806

KW - CAES-EEA: Efficient Embedded Architectures

U2 - 10.1109/RTAS.2007.12

DO - 10.1109/RTAS.2007.12

M3 - Conference contribution

SN - 0-7695-2800-7

SP - 281

EP - 292

BT - Proceedings of the 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS'07

PB - IEEE

CY - Los Alamitos, CA, United States

T2 - 13th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2007

Y2 - 3 April 2007 through 6 April 2007

ER -