Temporal floorplanning using 3D-subTCG

Improving logic capacity by time-sharing. dynamically reconfigurable FFGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topological floorplan representation, named 3D-subTCC (?-Dimensional sub-Transitive Closure Graph) to deal with the 3-dimensional (temporal) floorplanninglplacement problem. arising from dynamically reconfigurable FPGAs. The 3D-subTCG uses three transitive closure graphs to model the temporal and spatial relations between modules. We derive the feasibility conditions for the precedence constraints induced by the execution of the dynamically reconfigurable FPGAs. Because the geometric relationship is transparent to 3D-subTCG and its induced operations, we can easily detect any violation of temporal precedence constraints on 3D-aubTCG. We also derive imponant properties of the 3D-subTCG to reduce the solution space and shorten the running time for 3D (temporal) fwrplanninglplacement. Experimental results show that our 3D-subTCG based algorithm is very effective and efficient.