A new min-cut placement algorithm for timing assurance layout design meeting net length constraint
Masayuki Terai, Kazuhiro Takahashi, Koji Sato · 1990
This paper presents a new min-cut placement algorithm for timing assurance layout design. When critical nets are given net length constraints, the proposed algorithm can place cells so that the constraints may be met. This algorithm is built into the layout system for gate arrays called GALOP [1] and has been successfully applied to clock skew control of an ECL 12K-gate gate array.