Loading...
A fast minimum cost flow algorithm for regenerating optimal layout of functional cells
Author(s)
Arungsrisangchai, Itthichai
Shigehirq, Yuji
Shirakawa, Isao
Takahash, Hiromitsu
Date Issued
January 1, 1997
Type
Article
Abstract
A new flow algorithm is described on the basis of the primal-dual method, which is to be adopted dedicatedly for the regeneration of optimal layouts for functional cells of the standard-cell level. In advance of discussing this main theme, the present paper first outlines a practical scheme of reusing those layouts which have been once generated for functional cells in an old fabrication technology, and then formulates an optimization problem for regenerating optimal layouts of functional cells under the constraints incurred by the renewal of design rules. An efficient algorithm proposed here aims at solving this optimization problem with the use of solution concepts for the minimum cost flow problem. A part of experimental results is also shown, which indicates that the proposed algorithm is the fastest for this optimization problem.
Citation
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E80-A(12), 2589-2599, 1997