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.

Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures

In English

Författare

  • Christophe Wolinski
  • Krzysztof Kuchcinski
  • Jürgen Teich
  • Frank Hannig

Summary, in English

In this paper, we present a constraint programming-based approach for optimization of routing and reconfiguration overhead for a class of reconfigurable processor array architectures called weakly programmable. For a given set of different algorithms the execution of which is supposed to be switched upon request at run-time, we provide static solutions for optimal routing of data between processor elements as well as for minimization of the routing area and the reconfiguration overhead when switching between the execution of these algorithms. Our experiments confirm that our method can minimize routing overhead and reduce reconfiguration time significantly.

Publiceringsår

2008-12-22

Språk

Engelska

Sidor

306-309

Publikation/Tidskrift/Serie

16th International Symposium on Field-Programmable Custom Computing Machines, 2008. FCCM '08.

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Computer Science

Conference name

16th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM)

Conference date

2008-04-14 - 2008-04-15

Conference place

Palo Alto, CA, United States

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 978-0-7695-3307-0