Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

Författare

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.

Publiceringsår

2013

Språk

Engelska

Publikation/Tidskrift/Serie

IEEE International Symposium on Circuits and Systems

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • 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

Forskningsgrupp

  • ESDLAB