Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures

Beitrag bei einer Tagung


Details zur Publikation

Autorinnen und Autoren: Wolinski C, Kuchcinski K, Teich J, Hannig F
Titel Sammelwerk: Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08
Jahr der Veröffentlichung: 2008
Tagungsband: Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines
Seitenbereich: 306-309


Abstract


In this paper, we present a constraint programmingbased 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. © 2008 IEEE.



FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Hannig, Frank PD Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


Einrichtungen weiterer Autorinnen und Autoren

Université de Rennes 1 / University of Rennes 1


Zitierweisen

APA:
Wolinski, C., Kuchcinski, K., Teich, J., & Hannig, F. (2008). Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures. In Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines (pp. 306-309). Palo Alto, CA, US.

MLA:
Wolinski, Christophe, et al. "Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures." Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM), Palo Alto, CA 2008. 306-309.

BibTeX: 

Zuletzt aktualisiert 2018-09-08 um 22:24