Area and Reconfiguration Time Minimization of the Communication Network in Regular 2D Reconfigurable Architectures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Area and Reconfiguration Time Minimization of the Communication Network in Regular 2D Reconfigurable Architectures

Abstract

In this paper, we introduce a constraint programming- based approach for the optimization of area and of reconfiguration time for communication networks for a class of regular 2D reconfigurable processor array architectures. 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 the optimal routing of data between processors. Here, we support also multi-casting data transfers for the first time. The routing found by our method minimizes the area or the reconfiguration time of the communication network, when switching between the execution of these algorithms. In fact, when switching, the communication network reconfiguration can be executed in just a few clock cycles. Moreover the communication network area can be minimized signifiHeidelbergcantly (62% in average).
Fichier principal
Vignette du fichier
wolinski-fpl08.pdf (292.49 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00451667 , version 1 (29-01-2010)

Identifiers

Cite

Christophe Wolinski, Krzysztof Kuchcinski, Jürgen Teich, Frank Hannig. Area and Reconfiguration Time Minimization of the Communication Network in Regular 2D Reconfigurable Architectures. International Conference on Field Programmable Logic and Applications (FPL 2008), Sep 2008, Heidelberg, Germany. pp.391-396, ⟨10.1109/FPL.2008.4629969⟩. ⟨inria-00451667⟩
278 View
206 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More