Task Partitioning for the Scheduling on Reconfigurable Systems driven by Specification Self-Similarity
Martina Irene Giani, Massimo Redaelli, Marco Domenico Santambrogio, Donatella Sciuto · Virtual Community of Pathological Anatomy (University of Castilla La Mancha) · 2007
A new model for the reconfiguration problem on partially dynamically reconfigurable fpgas and a new graph–theoretic algorithm for the temporal and spatial partitioning of a specification on the same vlsi architectures are proposed. A problem in the field of reconfigurable hardware systems is that there is no clear way to partition a given specification in order to implement it on such an architecture. Many of the existing approaches rely on the designer to carry out the partitioning based on his knowledge of the desired behaviour. However, this is not a desirable assumption if one wants to allow designers to take advantage of reconfigurable architectures in a simple and straightforward way. In this paper we propose a novel approach to the partitioning of a system specification by detecting recurrent structures in the specification itself, with the objective of identifying modules that can be used more than once during the application lifetime, thus saving device resources and reconfiguration time. A comparison with respect to the amount and size of the identified recurrent structures was carried out using widely used algorithms as working examples to support the proposed model.