Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 2, Issue 2, Pages 117-129
http://dx.doi.org/10.1155/1994/60143

An Effective Solution to the Linear Placement Problem

Computer Science Department, University of Missouri-Columbia, Mathematical Sciences Building, Columbia 65211, MO, USA

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We present an effective solution to the linear placement problem, which has several applications in the physical design of integrated circuits. Our approach belongs to the class of iterative improvement heuristics. The important difference of this new technique from the previous ones is in its moves, and in the order of application of these moves. A phase of the algorithm begins with simple moves and gradually shifts towards more complex moves. Phases are repeated as long as further improvement is possible. Our experimental results show that nearly optimal solutions can be achieved. For a number of examples collected from the literature, our algorithm generated optimal solutions.