A template mapping algorithm for reconfigurable computing

RCA(reconfigurable cell array) is a hardware accelerating set. In order to find out set of computations which could exert the capacity of RCA in DFG(data flow graph), reducing the execution time of system to accomplish a specific arithmetic, a template mapping algorithm is proposed. It could be used to find RCA’s templates in DFG. Compare to previous template mapping algorithm, the new algorithm has two applied features: mapping node with more than one input; mapping template with ring structure in graph. C++ code is accomplished to validate the correctness of algorithm.