A Low-Cost Distributed Mapping for Large-Scale Applications of Reconfigurable Computing Systems

Reconfiguration capability in nowadays embedded systems such as Reconfigurable Computing (RC) systems improves the execution of applications efficiently. However, the reconfiguration overhead in the mapping process of application compilation degrades the performance of these systems. In this paper, a novel distributed application graph mapping has been proposed to reduce the heavy computations of mapping problem analytically. For this purpose, matrix modifications have been used to derive a distance model in resource graph. Using this model, it is possible to remove heavy-weight values from the search space of solutions and achieve a low-cost solution faster, as well. This model classifies the distance matrix of resource graph into independent regions to transform the mapping problem into suboptimal problems. Simulation results show that the proposed approach for application graph mapping outperformed the stateof-art methods in terms of complexity and time overhead, especially for large-scale application graphs.