Applying Single Processor Algorithms to Schedule Tasks on Reconfigurable Devices Respecting Reconfiguration Times

In the single machine environment, several schedul-ing algorithms exist that allow to quantify schedules with respect to feasibility, optimality, etc. In contrast, reconfigurable devices execute tasks in parallel, which intentionally collides with the single machine princi-ple and seems to require new methods and evaluation strategies for scheduling. However, the reconfiguration phases of adaptable architectures usually take place se-quentially. Run-time adaptation is realized using an exclusive port, which is occupied for some reasonable time during reconfiguration. Thus, we can find an anal-ogy to the single machine environment. In this paper, we investigate the appliance of single processor schedul-ing algorithms to task reconfiguration on reconfigurable systems. We determine necessary adaptations and pro-pose methods to evaluate the scheduling algorithms.