A binding algorithm for retargetable compilation to non-orthogonal datapath architectures

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 binding algorithm to solve this problem. In the experiments, a feasible binding which satisfies the reachability is found or the deficiency of the datapath is detected within a few seconds,