Macro-modules′ Legalization Algorithm Modeled by Gragh
In this paper,we propose a directed constraint graphic based algorithm to legalize the macros.It creates two directed graphs,the horizontal one and the vertical one.Each macro is abstracted as a node in each graph,and the position relationship of every pair of macros is abstracted as edges in graphs.This algorithm abstracts the macro legalization problem to a graphic problem,and greatly reduces the complexity of the problem.Experiments show that the algorithm can be very effective.