Temporal Partitioning and Quantitative Analysis of Behaviour Level Algorithms for Dynamic Reconfigurable Systems
Pan Cheng · Journal of Chinese Computer Systems · 2011
Temporal partitioning algorithms for reconfigurable systems proposed in recent 20 years are analyzed in the paper.They are classified as netlist-level class and behaviour-level class.The netlist-level temporal partitioning algorithms are mainly based on network flow techniques.They target minimization of the area and the number of cutting nets of the circuit to get less time delay and communication cost.Behaviour-level partitioning algorithms including level-based partitioning(LBP),cluster based partitioning(CBP),enhanced static list(ESL) and multi-objective temporal partitioning(MOTP) are qualitatively analyzed.Measures for the evaluation include the number of partitioned modules,the number of input/output edges acrossing modules and the total delay of all modules.Experimental results show that the LBP has the smallest total delay in four algorithms;the CBP has less inter-module′s input/output edges,and the ESL and MOTP achieve a good compromise among three measures.However,four algorithms do not consider the shape and the cost of cross-layer mapping of partitioned modules.