A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
VLSI design (Print)
This paper presents two primary results relevant t o p h ysical design problems in CAD VLSI through a case study of the linear placement problem. First a local search mechanism which incorporates a neighborhood operator based on constraint relaxation is proposed. The strategy exhibits many of the desirable features of analytical placement while retaining the exibility and non-determinism of local search. The second and orthogonal contribution is in netlist clustering. We c haracterize localdoi:10.1080/10655140290010060 fatcat:asngxdo5rvgstpfe4hlxonydz4