Patent ID: 6412100
Filing Date: 2002-06-25
Classification: G06F

Abstract:
A method of processing a layout optimization problem in which it is requested to find the optimal layout on a predetermined layout space for a plurality of elements that ought to be subjected to a predetermined connection relationship, comprising:executing, when first information concerning the plurality of elements staying in an initial condition is available, a genetic algorithm based on the first information reducing non-uniformity in density of the plurality of elements and bringing the plurality of elements into a layout unbalance reduction halfway stage; and executing, when second information concerning the plurality of elements staying in the layout unbalance reduction halfway stage is available, a local layout unbalance reducing algorithm, that moves one or more elements from a high-density location to a low-density location within each of a plurality of local sub-spaces of the predetermined layout space, based on the second information, further reducing the non-uniformity in density of the plurality of elements staying in the layout unbalance reduction halfway stage.