Iterative Synthesis Methods Estimating Programmable-Wire Congestion in a Dynamically Reconfigurable Processor

Takao TOI; Takumi OKAMOTO; Toru AWASHIMA; Kazutoshi WAKABAYASHI; Hideharu AMANO

doi:10.1587/transfun.E94.A.2619

Iterative Synthesis Methods Estimating Programmable-Wire Congestion in a Dynamically Reconfigurable Processor

Takao TOI, Takumi OKAMOTO, Toru AWASHIMA, Kazutoshi WAKABAYASHI, Hideharu AMANO

Full Text Views

0

Share
Cite this

Summary :

Iterative synthesis methods for making aware of wire congestion are proposed for a multi-context dynamically reconfigurable processor (DRP) with a large number of processing elements (PEs) and programmable-wire connections. Although complex data-paths can be synthesized using the programmable-wire, its delay is long especially when wire connections are congested. We propose two iterative synthesis techniques between a high-level synthesizer (HLS) and the place & route tool to shorten the prolonged wire delay. First, we feed back wire delays for each context to a scheduler in the HLS. The experimental results showed that a critical-path delay was shorten by 21% on average for applications with timing closure problems. Second, we skip the routing and estimate wire delays based on the congestion. The synthesis time was shorten to 1/3 causing delay improvement rate degradation at two points on average.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.12 pp.2619-2627

Publication Date: 2011/12/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E94.A.2619

Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)

Category: High-Level Synthesis and System-Level Design

Cite this

Copy

Takao TOI, Takumi OKAMOTO, Toru AWASHIMA, Kazutoshi WAKABAYASHI, Hideharu AMANO, "Iterative Synthesis Methods Estimating Programmable-Wire Congestion in a Dynamically Reconfigurable Processor" in IEICE TRANSACTIONS on Fundamentals, vol. E94-A, no. 12, pp. 2619-2627, December 2011, doi: 10.1587/transfun.E94.A.2619.
Abstract: Iterative synthesis methods for making aware of wire congestion are proposed for a multi-context dynamically reconfigurable processor (DRP) with a large number of processing elements (PEs) and programmable-wire connections. Although complex data-paths can be synthesized using the programmable-wire, its delay is long especially when wire connections are congested. We propose two iterative synthesis techniques between a high-level synthesizer (HLS) and the place & route tool to shorten the prolonged wire delay. First, we feed back wire delays for each context to a scheduler in the HLS. The experimental results showed that a critical-path delay was shorten by 21% on average for applications with timing closure problems. Second, we skip the routing and estimate wire delays based on the congestion. The synthesis time was shorten to 1/3 causing delay improvement rate degradation at two points on average.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.2619/_p

Copy

@ARTICLE{e94-a_12_2619,
author={Takao TOI, Takumi OKAMOTO, Toru AWASHIMA, Kazutoshi WAKABAYASHI, Hideharu AMANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Iterative Synthesis Methods Estimating Programmable-Wire Congestion in a Dynamically Reconfigurable Processor},
year={2011},
volume={E94-A},
number={12},
pages={2619-2627},
abstract={Iterative synthesis methods for making aware of wire congestion are proposed for a multi-context dynamically reconfigurable processor (DRP) with a large number of processing elements (PEs) and programmable-wire connections. Although complex data-paths can be synthesized using the programmable-wire, its delay is long especially when wire connections are congested. We propose two iterative synthesis techniques between a high-level synthesizer (HLS) and the place & route tool to shorten the prolonged wire delay. First, we feed back wire delays for each context to a scheduler in the HLS. The experimental results showed that a critical-path delay was shorten by 21% on average for applications with timing closure problems. Second, we skip the routing and estimate wire delays based on the congestion. The synthesis time was shorten to 1/3 causing delay improvement rate degradation at two points on average.},
keywords={},
doi={10.1587/transfun.E94.A.2619},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - Iterative Synthesis Methods Estimating Programmable-Wire Congestion in a Dynamically Reconfigurable Processor
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2619
EP - 2627
AU - Takao TOI
AU - Takumi OKAMOTO
AU - Toru AWASHIMA
AU - Kazutoshi WAKABAYASHI
AU - Hideharu AMANO
PY - 2011
DO - 10.1587/transfun.E94.A.2619
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2011
AB - Iterative synthesis methods for making aware of wire congestion are proposed for a multi-context dynamically reconfigurable processor (DRP) with a large number of processing elements (PEs) and programmable-wire connections. Although complex data-paths can be synthesized using the programmable-wire, its delay is long especially when wire connections are congested. We propose two iterative synthesis techniques between a high-level synthesizer (HLS) and the place & route tool to shorten the prolonged wire delay. First, we feed back wire delays for each context to a scheduler in the HLS. The experimental results showed that a critical-path delay was shorten by 21% on average for applications with timing closure problems. Second, we skip the routing and estimate wire delays based on the congestion. The synthesis time was shorten to 1/3 causing delay improvement rate degradation at two points on average.
ER -