IEICE TRANSACTIONS on Fundamentals
A Binding Algorithm for Retargetable Compilation to Non-orthogonal DSP Architectures
Summary :
This paper presents a new binding algorithm for a retargetable compiler which can deal with diverse architectures of application specific embedded processors. The architectural diversity includes a "non-orthogonal" datapath configuration where all the registers are not equally accessible by all the functional units. Under this assumption, binding becomes a hard task because inadvertent assignment of an operation to a functional unit may rule out possible assignment of other operations due to unreachability among datapath resources. We propose a new BDD-based algorithm to solve this problem. While most of the conventional methods are based on the covering of expression trees obtained by decomposing DFGs, our algorithm works directly on the DFGs so as to avoid infeasible bindings. In the experiments, a feasible binding which satisfies the reachability is found or the deficiency of datapath is detected within a few seconds.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.12 pp.2630-2639
- Publication Date
- 1998/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
- Compiler
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masayuki YAMAGUCHI, Nagisa ISHIURA, Takashi KAMBE, "A Binding Algorithm for Retargetable Compilation to Non-orthogonal DSP Architectures" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 12, pp. 2630-2639, December 1998, doi: .
Abstract: This paper presents a new binding algorithm for a retargetable compiler which can deal with diverse architectures of application specific embedded processors. The architectural diversity includes a "non-orthogonal" datapath configuration where all the registers are not equally accessible by all the functional units. Under this assumption, binding becomes a hard task because inadvertent assignment of an operation to a functional unit may rule out possible assignment of other operations due to unreachability among datapath resources. We propose a new BDD-based algorithm to solve this problem. While most of the conventional methods are based on the covering of expression trees obtained by decomposing DFGs, our algorithm works directly on the DFGs so as to avoid infeasible bindings. In the experiments, a feasible binding which satisfies the reachability is found or the deficiency of datapath is detected within a few seconds.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_12_2630/_p
Copy
@ARTICLE{e81-a_12_2630,
author={Masayuki YAMAGUCHI, Nagisa ISHIURA, Takashi KAMBE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Binding Algorithm for Retargetable Compilation to Non-orthogonal DSP Architectures},
year={1998},
volume={E81-A},
number={12},
pages={2630-2639},
abstract={This paper presents a new binding algorithm for a retargetable compiler which can deal with diverse architectures of application specific embedded processors. The architectural diversity includes a "non-orthogonal" datapath configuration where all the registers are not equally accessible by all the functional units. Under this assumption, binding becomes a hard task because inadvertent assignment of an operation to a functional unit may rule out possible assignment of other operations due to unreachability among datapath resources. We propose a new BDD-based algorithm to solve this problem. While most of the conventional methods are based on the covering of expression trees obtained by decomposing DFGs, our algorithm works directly on the DFGs so as to avoid infeasible bindings. In the experiments, a feasible binding which satisfies the reachability is found or the deficiency of datapath is detected within a few seconds.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Binding Algorithm for Retargetable Compilation to Non-orthogonal DSP Architectures
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2630
EP - 2639
AU - Masayuki YAMAGUCHI
AU - Nagisa ISHIURA
AU - Takashi KAMBE
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1998
AB - This paper presents a new binding algorithm for a retargetable compiler which can deal with diverse architectures of application specific embedded processors. The architectural diversity includes a "non-orthogonal" datapath configuration where all the registers are not equally accessible by all the functional units. Under this assumption, binding becomes a hard task because inadvertent assignment of an operation to a functional unit may rule out possible assignment of other operations due to unreachability among datapath resources. We propose a new BDD-based algorithm to solve this problem. While most of the conventional methods are based on the covering of expression trees obtained by decomposing DFGs, our algorithm works directly on the DFGs so as to avoid infeasible bindings. In the experiments, a feasible binding which satisfies the reachability is found or the deficiency of datapath is detected within a few seconds.
ER -
English
