Wolinski C, Kuchcinski K, Teich J, Hannig F (2008)
Publication Type: Conference contribution
Publication year: 2008
Edited Volumes: Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM'08
Pages Range: 306-309
Conference Proceedings Title: Proceedings of the 16th IEEE Symposium on Field-Programmable Custom Computing Machines
DOI: 10.1109/FCCM.2008.16
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.
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: Download