Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures
Wolinski, Christophe ; Kuchcinski, Krzysztof LU
; Teich, Jürgen
and Hannig, Frank
(2008)
16th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM)
p.306-309
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1051894
- author
- Wolinski, Christophe
; Kuchcinski, Krzysztof
LU
; Teich, Jürgen
and Hannig, Frank
- organization
- publishing date
- 2008-12-22
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- 16th International Symposium on Field-Programmable Custom Computing Machines, 2008. FCCM '08.
- pages
- 306 - 309
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 16th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM)
- conference location
- Palo Alto, CA, United States
- conference dates
- 2008-04-14 - 2008-04-15
- external identifiers
-
- scopus:54949124115
- ISBN
- 978-0-7695-3307-0
- DOI
- 10.1109/FCCM.2008.16
- language
- English
- LU publication?
- yes
- id
- a97c001b-b2e9-43fa-834a-f29657a75faa (old id 1051894)
- date added to LUP
- 2016-04-04 14:33:13
- date last changed
- 2022-01-30 05:41:26
@inproceedings{a97c001b-b2e9-43fa-834a-f29657a75faa,
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.}},
author = {{Wolinski, Christophe and Kuchcinski, Krzysztof and Teich, Jürgen and Hannig, Frank}},
booktitle = {{16th International Symposium on Field-Programmable Custom Computing Machines, 2008. FCCM '08.}},
isbn = {{978-0-7695-3307-0}},
language = {{eng}},
month = {{12}},
pages = {{306--309}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Optimization of Routing and Reconfiguration Overhead in Programmable Processor Array Architectures}},
url = {{http://dx.doi.org/10.1109/FCCM.2008.16}},
doi = {{10.1109/FCCM.2008.16}},
year = {{2008}},
}