Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures

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

doi:10.1109/fccm.2008.16

Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures

Christophe Wolinski, Jürgen Teich + Show 2 more

https://doi.org/10.1109/fccm.2008.16

Copy DOI

Publication Date: Apr 1, 2008

Citations: 10

Affiliation: Institut de Recherche en Informatique et Systèmes Aléatoires, University of Rennes, University of Erlangen-Nuremberg

#Reconfiguration Overhead #Minimize Routing Overhead + Show 8 more

Abstract
Full-Text
Similar Papers

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.