An Effective Solution to the LinearPlacement Problem

Youssef Saab,Cheng-Hua Chen

doi:10.1155/1994/60143

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.

Highlights

He linear placement problem (LPP) occurs in different forms in the physical design automation of integrated circuits
The original problem is par- the clustering and the linear placement steps are intitioned into a number of levels in a bottom-up con- ter-mixed
Since limited exhaustive search strategy (LESS) assumes that all the nets have unit weights, every net of weight was replaced by nets identical to it

Summary

Introduction

He linear placement problem (LPP) occurs in different forms in the physical design automation of integrated circuits. Given a circuit (V, E), a linear placement problem (LPP) seeks a permutation 7r, which minimizes a An iterative improvement algorithm starts with some certain cost function.

Results

Conclusion