floorplanning with alignment and performance constraints
In this paper, we present a floorplanning algorithm based on sequence pair representation. Our floorplanner has the following important features: 1) It is explicitly designed for fixed-frame floorplanning, which is different from traditional well-researched min-area floorplanning. Moreover, we also show that it can be adapted to minimize total area. 2) It addresses the problem of handling alignment constraint which arises in bus structure. 3) It deals with performance constraint such as bounded net delay, while many existing floorplanners just minimize total wire length. 4) More importantly, even with all these constraints the algorithm is very fast in that it evaluates the feasibility of a sequence pair and translates to a floorplan in O ( n log log n ) time typically where n is the number of blocks and the number of constrained blocks is O(n) , which is significantly faster than the O(n 3 ) method operating on constraint graph. Our algorithm is based on computing the longest common subsequence of a pair of weighted sequences. Experimental results on MCNC benchmark for block placement show the promise of the method.
floorplanning aligning performance constraint paper algorithm sequence pair sequence representation feature structure delay log timing blocking method operability graph computation longest common subsequence experimentation benchmark placement