Conventional mapping approaches to reconfigurable Computing utilize CAD tools to perform the technology mapping of a hihg-level design. In ocmparison with the execution time on the hardware, extensive amount of time is spent for compilation by the CAD tools. However, the long compilation time is not always considered when evaluating the time performance of RC solutions. In this paper, we propose a domain specific mapping approach for solving graph problems. The key idea is to alleviate the intervention of the CAD tools at mapping time. High-level designs are synthesized with respect to the specific domain and are adapted ot the input grah instance at run-time. The domain is defined by the algorithm and the reconfigurable target. The proposed approach leads to predictable RC solutions with superior time performance. The time perofrmance metric includes both the mapping time an the execution time. For example, in the case of the single-source shortest path problem, the estimated run-time speed-up is 10 sup 6 compared with the state-of-the-art. in comparison with software implementations. The estimated run-time speed-up is asymptotically 3.75 and can be improved by further optimization of the hardware design or improvement of the configuration time.
展开▼
