Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00451676
Contributor : François Charot <>
Submitted on : Friday, January 29, 2010 - 4:21:11 PM
Last modification on : Wednesday, December 18, 2019 - 5:29:03 PM

Identifiers

Citation

Christophe Wolinski, Krzysztof Kuchcinski, Jürgen Teich, Frank Hannig. Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures. 16th International Symposium on Field-Programmable Custom Computing Machines (FCCM 2008), Apr 2008, Palo Alto, United States. pp.306-309, ⟨10.1109/FCCM.2008.16⟩. ⟨inria-00451676⟩

Share

Metrics

Record views

280