Mapping data-flow graph to loop engine on array processor
Yong Dou, Xicheng Lu · 2003
We present a novel architecture for array processor, called LEAP, which is a set of simple processing elements. The targeted programs are perfect innermost loops. By using the technique called if-conversion, the control dependence can be converted to data dependence to prediction variables. Then an innermost loop can be represented by a data dependence graph, where the vertex supports the expression statements of high level languages. By mapping the data dependence graph to fixed PEs, each PE steps the loop iteration automatically and independently at the runtime. The execution forms multiple pipelining chains. The simulation of four loops of LFK shows the effectiveness of the LEAP architecture, compared with traditional CISC and RISC architectures.