On the relative placement and the transportation problem for standard-cell layout

Authors:
Knut M. Just;Jürgen M. Kleinhans;Frank M. Johannes
Affiliations:
Institute of Computer-Aided Design, Department of Electrical Engineering, Technical University of Munich;Institute of Computer-Aided Design, Department of Electrical Engineering, Technical University of Munich;Institute of Computer-Aided Design, Department of Electrical Engineering, Technical University of Munich
Venue:
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Year:
1986

Citing 6
Cited 4

Near-optimal placement using a quadratic objective function

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Partitioning for VLSI placement problems

DAC '81 Proceedings of the 18th Design Automation Conference
Some experimental results on placement techniques

DAC '76 Proceedings of the 13th Design Automation Conference
A class of min-cut placement algorithms

DAC '77 Proceedings of the 14th Design Automation Conference
A combined force and cut algorithm for hierarchical VLSI layout

DAC '82 Proceedings of the 19th Design Automation Conference
A min-cut placement algorithm for general cell assemblies based on a graph representation

DAC '79 Proceedings of the 16th Design Automation Conference

Efficient final placement based on nets-as-points

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A combined hierarchical placement algorithm

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A quadratic metric with a simple solution scheme for initial placement

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region

EURO-DAC '90 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new two-phased method for the simultaneous placement of modules for standard-cell layout is presented. In phase one, a relative placement is calculated by application of an iterative solution method taking advantage of net-list scarcity. A fast algorithm is derived from a new formulation of the problem. In addition, signal weights and pin coordinates are considered. In phase two, different-sized modules are assigned to physical locations by solving a transportation problem.