The reproducing placement problem with applications

Authors:
Wei-Liang Lin;M. Sarrafzadeh;C. K. Wong
Affiliations:
Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Watson Research Center, IBM Corp., Yorktown Heights, NY
Venue:
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Year:
1994

Citing 3
Cited 1

The 1-Steiner tree problem

Journal of Algorithms
VLSI cell placement techniques

ACM Computing Surveys (CSUR)
Layout driven technology mapping

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference

Timing driven placement in interaction with netlist transformations

Proceedings of the 1997 international symposium on Physical design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is to find a “good” placement in each phase. The problem, being iterative in nature, requires an iterative algorithm. The problem finds applications in several gate-level placement problems, e.g., in layout-driven logic synthesis.We introduce the notion of minimum floating Steiner trees (MFST). We employ an MFST algorithm as a central step in solving the RPP. A Hanan-like theorem is established for the MFST problem and two approximation algorithms are proposed. Experiments on commonly employed benchmarks verify the effectiveness of the proposed technique.