Skip to Main Content
Reconfiguration overhead is an important obstacle that limits the performance of on-line scheduling algorithms in reconfigurable computing systems and increases the overall execution time. Configuration reusing (task reusing) can decrease reconfiguration overhead considerably, particularly in periodic applications. In this paper, we present a new approach for on-line scheduling and placement in which configuration reusing is considered as a main characteristic in order to reduce reconfiguration overhead and decrease total execution time of the tasks. A large variety of experiments have been conducted on the proposed algorithm. Obtained results show considerable improvement in overall execution time of the tasks.