Communication Cost Reduction For Hardware Tasks Placed on Homogeneous Reconfigurable Resource
Résumé
The management of a reconfigurable resource included in a System-on-Chip is a difficult problem due to spatial resource allocation to ensure for each new task to schedule. This problem becomes more difficult when the communications between tasks are also considered during the task placement. General techniques developed and proposed in the literature ignore this problem and generate solutions which can produce difficulties to manage the data exchanges onto the communication media. We claim that, even if some methods seem very interesting, due to low task rejection rate, the placement must be realized with the objective to limit the problem for the data routing during task communications. This paper addresses this research topic by extending one specific method of tasks management, based on a Vertex List which enables a fast and efficient evaluation of task position into the reconfigurable resource. The method proposed consists in evaluating all the vertices and finding the best vertex to limit the communication cost. Results show that, our method reduces a significant communication cost compared to well-known methods Kamers which keep all maximal empty rectangles.