Resource Management for Reconfigurable Computing Systems

摘要

Task placement problem is one of the most significant and time-consuming parts in reconfigurable computing system. Many investigators have explored on the subject, and most of the traditional studies are focused on free space management in the device. The aim of the free space management algorithm is to find all available free spaces to place a new module. Moreover, the algorithms proposed in the literature are heuristic algorithms, and does not offer a good compromise between the placement quality and the execution time. In order to remedy these problems and to obtain satisfactory results, in this paper we propose a module placement algorithm based on mathematical model that aims to minimize the total communication costs between modules. The results show a significant improvement in communication costs compared to other approaches.