Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

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

doi:10.1109/DATE.2008.4484749

Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

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

10 Citations (Scopus)

281 Downloads (Pure)

Abstract

Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application.

Original language	Undefined
Title of host publication	Design Automation and Test in Europe
Place of Publication	San Jose, CA, USA
Publisher	EDA Consortium
Pages	640-645
Number of pages	6
ISBN (Print)	978-3-9810801-4-8
DOIs	https://doi.org/10.1109/DATE.2008.4484749
Publication status	Published - 10 Mar 2008
Event	2008 Design, Automation & Test in Europe Conference & Exhibition, DATE 2008 - Munich, Germany Duration: 10 Mar 2008 → 14 Mar 2008

Publication series

Name
Publisher	EDA Consortium
Number	1

Conference

Conference	2008 Design, Automation & Test in Europe Conference & Exhibition, DATE 2008
Abbreviated title	DATE
Country/Territory	Germany
City	Munich
Period	10/03/08 → 14/03/08

Keywords

IR-64751
EWI-12658
METIS-250972

Access to Document

10.1109/DATE.2008.4484749

Cite this

@inproceedings{f90935e484f742869e158abaabe4e32b,

title = "Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication",

abstract = "Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application.",

keywords = "IR-64751, EWI-12658, METIS-250972",

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

note = "10.1109/DATE.2008.4484749 ; 2008 Design, Automation & Test in Europe Conference & Exhibition, DATE 2008 ; Conference date: 10-03-2008 Through 14-03-2008",

year = "2008",

month = mar,

day = "10",

doi = "10.1109/DATE.2008.4484749",

language = "Undefined",

isbn = "978-3-9810801-4-8",

publisher = "EDA Consortium",

number = "1",

pages = "640--645",

booktitle = "Design Automation and Test in Europe",

}

Wiggers, MH, Bekooij, MJG, Bekooij, MJG & Smit, GJM 2008, Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication. in Design Automation and Test in Europe., 10.1109/DATE.2008.4484749, EDA Consortium, San Jose, CA, USA, pp. 640-645, 2008 Design, Automation & Test in Europe Conference & Exhibition, DATE 2008, Munich, Bavaria, Germany, 10/03/08. https://doi.org/10.1109/DATE.2008.4484749

Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication. / Wiggers, M.H.; Bekooij, Marco Jan Gerrit; Bekooij, Marco J.G. et al.
Design Automation and Test in Europe. San Jose, CA, USA: EDA Consortium, 2008. p. 640-645 10.1109/DATE.2008.4484749.

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

TY - GEN

T1 - Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

AU - Wiggers, M.H.

AU - Bekooij, Marco Jan Gerrit

AU - Bekooij, Marco J.G.

AU - Smit, Gerardus Johannes Maria

N1 - 10.1109/DATE.2008.4484749

PY - 2008/3/10

Y1 - 2008/3/10

N2 - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application.

AB - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application.

KW - IR-64751

KW - EWI-12658

KW - METIS-250972

U2 - 10.1109/DATE.2008.4484749

DO - 10.1109/DATE.2008.4484749

M3 - Conference contribution

SN - 978-3-9810801-4-8

SP - 640

EP - 645

BT - Design Automation and Test in Europe

PB - EDA Consortium

CY - San Jose, CA, USA

T2 - 2008 Design, Automation & Test in Europe Conference & Exhibition, DATE 2008

Y2 - 10 March 2008 through 14 March 2008

ER -