A Genetic Algorithm Based Solution for Dynamically Reconfigurable Modules Allocation

The advances in the programmable hardware have lead to new architectures, where the hardware can be dynamically adapted to the application to gain better performance. One of the problems in realizing dynamically reconfigurable systems is the allocation of dynamically reconfigurable modules. In this scenario, when a new module has to be reconfigured in the system, there is the need to find a suitable free place where it can be configured. In this work a genetic algorithm has been developed to solve the problem of dynamically reconfigurable modules allocation. The search task has been modeled with a genetic algorithm in which each chromosome represents a configuration status of the programmable devices and both crossover and mutation processes try to change the previously found location for the new module in order to achieve a better fitness, that stands for the goodness of the final solution.