A Two-stage Incremental Floorplanning Algorithm with Boundary Constraints

In this paper, the authors we introduce a two-stage strategy to solve the incremental floorplanning problem with boundary constraints. Firstly, slack push graph (SPG) and module exchange graph (MEG) are built according to the original floorplan. SPG describes the dead spaces between any two adjacent modules and the slack push distance of each module; MEG records the modules which have the same size character. At the first stage, the algorithm aims at boundary constraint satisfaction using two graphs; at the second stage, the algorithm aims at more performance optimization by the aid of MEG. The experimental results of MCNC benchmarks show the effectiveness of our algorithm