The optimum placement of blocks on a two-dimensional chip, which minimizes the total routing length of signal nets is considered. A new heuristic procedure, based on iterative improvement, is proposed. The procedure repeats random generation of an initial solution and its improvement by a sequence of local transformations. The best among the local optimum solutions is taken as a final solution. The iterative improvement method proposed here is different from the previous one, in the sense that it considers interchanging more than two blocks at the same time and examines only a small portion of feasible solutions which has high probability of being better. Experimental results show this procedure gives better solutions than the best one up to now. The computation time for each local optimum solution grows almost linearly with regard to the number of blocks.
|ジャーナル||NEC Research and Development|
|出版ステータス||Published - 1982 4月|
ASJC Scopus subject areas