The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

Author

Summary, in English

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.

Publishing year

2013

Language

English

Publication/Series

IEEE International Symposium on Circuits and Systems

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Computer Science

Conference name

IEEE International Symposium on Circuits and Systems (ISCAS), 2013

Conference date

2013-05-19 - 2013-05-23

Conference place

Beijing, China

Status

Published

Research group

  • ESDLAB