The reproducing placement problem with applications

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 nd a \good" placement in each phase. The problem, being iterative in nature, requires an iterative algorithm. The problem nds applications in several gate-level placement problems, e.g., in layout-driven logic synthesis. We introduce the notion of minimum oating 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 eectiveness of the proposed technique.

• Type: Conference
• Year: 1994
• Where: ICCAD
• Authors: Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
• Keywords: Gate-level Placement Problems, Hardware, ICCAD 1994, Placement Problems, Problem Nds Applications