Advanced

Buffer Optimization Based on Critical Path Analysis of a Dataflow Program Design

Brunet, Simone Casale; Mattavelli, Marco and Janneck, Jörn LU (2013) IEEE International Symposium on Circuits and Systems (ISCAS), 2013 In IEEE International Symposium on Circuits and Systems
Abstract
The trade-off between throughput and memory

constraints is a common design problem in embedded systems,

and especially for streaming applications, where the memory in

question usually occurs in the form of buffers for streams of data.

This paper presents a methodology, based on the post-processing

of dataflow execution traces, that enables designers to make

principled choices in the design space for arbitrary streaming

applications in a scalable manner. It significantly extends the class

of applications over traditional compile-time-only techniques,

and effectively enables designers to find a close-to-minimum

solution for this NP-complete problem. A... (More)
The trade-off between throughput and memory

constraints is a common design problem in embedded systems,

and especially for streaming applications, where the memory in

question usually occurs in the form of buffers for streams of data.

This paper presents a methodology, based on the post-processing

of dataflow execution traces, that enables designers to make

principled choices in the design space for arbitrary streaming

applications in a scalable manner. It significantly extends the class

of applications over traditional compile-time-only techniques,

and effectively enables designers to find a close-to-minimum

solution for this NP-complete problem. A heuristic algorithm

exploring different buffer size configurations lets designers choose

appropriate alternatives and enables them to rapidly navigate

the design space. Methodology and experimental results are

demonstrated in an at-size scenario using a real-world MPEG-4

SP decoder. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
IEEE International Symposium on Circuits and Systems
pages
4 pages
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Circuits and Systems (ISCAS), 2013
external identifiers
  • scopus:84883401782
language
English
LU publication?
yes
id
59e408fe-c189-4451-a42f-6c5d3206f7aa (old id 3407400)
date added to LUP
2013-01-24 12:25:57
date last changed
2017-05-07 04:35:07
@inproceedings{59e408fe-c189-4451-a42f-6c5d3206f7aa,
  abstract     = {The trade-off between throughput and memory<br/><br>
constraints is a common design problem in embedded systems,<br/><br>
and especially for streaming applications, where the memory in<br/><br>
question usually occurs in the form of buffers for streams of data.<br/><br>
This paper presents a methodology, based on the post-processing<br/><br>
of dataflow execution traces, that enables designers to make<br/><br>
principled choices in the design space for arbitrary streaming<br/><br>
applications in a scalable manner. It significantly extends the class<br/><br>
of applications over traditional compile-time-only techniques,<br/><br>
and effectively enables designers to find a close-to-minimum<br/><br>
solution for this NP-complete problem. A heuristic algorithm<br/><br>
exploring different buffer size configurations lets designers choose<br/><br>
appropriate alternatives and enables them to rapidly navigate<br/><br>
the design space. Methodology and experimental results are<br/><br>
demonstrated in an at-size scenario using a real-world MPEG-4<br/><br>
SP decoder.},
  author       = {Brunet, Simone Casale and Mattavelli, Marco and Janneck, Jörn},
  booktitle    = {IEEE International Symposium on Circuits and Systems},
  language     = {eng},
  pages        = {4},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  title        = {Buffer Optimization Based on Critical Path Analysis of a Dataflow Program Design},
  year         = {2013},
}