A Binding Algorithm for Retargetable Compilation to Non-orthogonal DSP Architectures (Special Section on VLSI Design and CAD Algorithms)

概要

論文の詳細を見る
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" detapath 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 detapath resources. We propose a new BDD-based algorithm to solve this problem. While modt 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.
社団法人電子情報通信学会の論文
1998-12-25