An efficient Full-and-Elimination approach for floorplan area minimization

Abstract

A new and efficient heuristic methodology, called Full-and-Elimination (FAE), is proposed to solve the floorplan area minimization problem. This approach is inspired by the game, Tetris'. The modules are selected one at a time and placed to the partial floorplan, while attempting to grow on upper, in a row-by-row manner, until all the modules are arranged to the floorplan. In each row, modules are tried to be placed without deadspace. If any row is filled up, this row is viewed as “full” and thus it is “eliminated”. The modules are sorted and constructively moved into the partial floorplan. A contour that encloses the top of the packed modules in the floorplan is constructed to help for arrangement of the modules. Experimental results on MCNC and GSRC benchmarks demonstrate that we obtain significant improvements on the area minimization and computational efforts. Particularly, our methodology provides greater improvement over other floorplanners as the number of modules increases, which is a feature of scalability.