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.

Execution trace graph analysis of dataflow programs: Bounded buffer scheduling and deadlock recovery using model predictive control

In English

Författare

  • Simone Casale Brunet
  • Endri Bezati
  • Marco Mattavelli
  • Massimo Canale
  • Jörn Janneck

Summary, in English

Execution trace graph analysis of dataflow programs has been demonstrated to be an effective way for exploring and optimizing the design space of many core applications. In this work a novel transformation from the execution trace graph to an event driven linear system is proposed. It is also illustrated how the trace space of can be effectively reduced and well known system control techniques can be efficiently used in order to find close to optimal solutions. In particular, the problem of finding a bounded buffer size configuration is proposed and solved using a model predictive controller. Two design examples, a JPEG and an MPEG HEVC decoder have been used to demonstrate the effectiveness of the approach.

Publiceringsår

2014

Språk

Engelska

Sidor

1-6

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Computer Science

Conference name

Design and Architectures for Signal and Image Processing (DASIP)

Conference date

2014-10-08 - 2014-10-10

Conference place

Madrid, Spain

Status

Published

Forskningsgrupp

  • EDSLab