On Approximation Methods for the Assignment Problem
Journal of the ACM (JACM)
Some experimental results on placement techniques
DAC '76 Proceedings of the 13th Design Automation Conference
A class of min-cut placement algorithms
DAC '77 Proceedings of the 14th Design Automation Conference
A placement capability based on partitioning
DAC '79 Proceedings of the 16th Design Automation Conference
Hi-index | 0.00 |
Classical Unconnected Set (UCS) and other iterative placement improvement algorithms may converge slowly toward desirable component arrangements. This paper discusses mechanisms that inhibit convergence, then proposes techniques for accelerating rate of improvement. A placer incorporating these procedures is described, and experimental results demonstrating effectiveness of the approach are given.