Reconfiguration-Aware Task Graph Scheduling

Due to increasing demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. We introduce the problem of real-time task scheduling under reconfiguration overhead on heterogeneous reconfigurable systems while considering the data dependencies and data communication overhead. We introduce a novel graph representation which captures the delay overhead due to data dependencies and reconfiguration. We formulate the problem as a network flow problem and provide a mixed integer linear programming solution to minimize the completion time so called makespan. Results show that our proposed scheduling improves the makespan by 24.20% (on average) in comparison with maximum-transition-overhead scheduling.