A novel scheduling algorithm for dynamically reconfigurable computing systems

This paper focuses on introducing a new temporal partitioning algorithm. It divides the input task graph model into an optimal number of partitions and puts each task in the appropriate partition in order to decrease the transfer of data required between partitions of the design. However typical scheduling algorithms focus on minimizing the overall latency of an input target graph.