Automatic Placement A Review of Current Techniques

Abstract

This review provides an overview of the placement function within automatic layout systems. The automatic placement problem is defined and the data abstractions are described. The discussion divides placement algorithms into two classes: constructive and iterative. Applications of the algorithms within layout systems are described. A large number of references is provided to allow use as a guide to placement literature.

A Fast Clustering‐Based Min‐Cut Placement AlgorithmWith Simulated‐Annealing Performance

“…A placement of a circuit into a rectangulation consists of assigning each of its nodes to a unique rectangle. The length of a rectangle residing in a slab that spans rows to h is equal to the sum of all the lengths Y. SAAB of the nodes assigned to it divided by h + 1. The x-coordinates of rectangles are computed according to the order of rectangles in their respective slabs from left to right.…”

“…The strategy is used to prune or reduce the number of placements explored in what would otherwise be a complete exhaustive search of all possible placements. Branch-and-bound algorithms tend to be computationally expensive and are not used except for problems of small size [1]. Branch-and-bound techniques have been reported in [15].…”

“…One of the best available simulated annealing placement package is Tim-berwolf 6 [7]. Min-cut algorithms rank second to simulated annealing in terms of placement quality but are substantially much faster [1,4]. The contribution of this paper is the design of a min-cut algorithm (ROW-PLACE) with results that are competitive with Timberwolf 6 in terms of quality.…”

A New Clustering Method Based onGeneral Connectivity

“…Therefore, there have been several independent efforts [13,15] directed towards obtaining the optimal placement solution efficiently.…”

Applied graph- theoretic approach for two- way to one- way road network conversion

“…The role in which tree building plays in traffic assignment is explained in greater detail in Section 2.2.4.5. As shown by Preas and Karger [27] and Yao et al [28], the overall net length can be further reduced by changing the orientation of the modules. The problem of finding the 20 ATTENTION: The Singapore Copyright Act applies to the use of this document.…”