Floorplan area minimization using Lagrangian relaxation

modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplanning stage. Area minimization in general non-slicing floorplan is a complicated problem. Many previous works have attempted to tackle this problem [9; 6; 5; l] using heuristics or numerical methods but none of them can solve it optimally and efficiently. In this paper, we show how this problem can be solved optimally by a geometric programming using Lagrangian relaxation. The resulting Lagrangian relaxation subproblem is so simple that the size of each module can be found in constant time. We implemented our idea in a simulated annealing framework based on the sequence pair representation. The area minimization procedure is invoked in every iteration of the annealing process but the total execution time is still very much faster than that of the most updated previous work [4]. For a benchmark data with 49 mod...

• Type: Conference
• Year: 2000
• Where: ISPD
• Authors: Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. Wong
• Keywords: Area Minimization, Floorplan Area Minimization, Hardware, ISPD 2000, Lagrangian Relaxation