Temporal partitioning of data flow graphs for reconfigurable architectures
Bouraoui Ouni, Abdellatif Mtibaa · International Journal of Computational Science and Engineering · 2014
In this paper, we present the famous temporal partitioning algorithms that temporally partition a data flow graph on reconfigurable systems. We have classified these algorithms into four classes: 1) whole latency optimisation algorithms; 2) whole communication cost optimisation algorithms; 3) whole area optimisation algorithms; 4) whole latency-communication cost optimisation algorithms. These algorithms can be used to solve the temporal partitioning problem at the behaviour level.