An efficient macro-cell placement algorithm

Authors:
E. H. L. Aarts;F. M. J. de Bont;J. H. M. Korst;J. M. J. Rongen
Affiliations:
Philips Research Laboratories, P.O. Box 80.000, 5600 JA Eindhoven, Netherlands and Eindhoven University of Technology P.O. Box 513, 5600 h1B Eindhoven, Netherlands;Philips Research Laboratories, P.O. Box 80.000, 5600 JA Eindhoven, Netherlands;Philips Research Laboratories, P.O. Box 80.000, 5600 JA Eindhoven, Netherlands;Philips Research Laboratories, P.O. Box 80.000, 5600 JA Eindhoven, Netherlands and Eindhoven University of Technology P.O. Box 513, 5600 h1B Eindhoven, Netherlands
Venue:
Integration, the VLSI Journal
Year:
1991

Citing 7
Cited 0

Optimal orientations of cells in slicing floorplan designs

Information and Control
Simulated annealing: theory and applications

Simulated annealing: theory and applications
On global wire ordering for macro-cell routing

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A new algorithm for floorplan design

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of design automation problems

DAC '80 Proceedings of the 17th Design Automation Conference
Automatic floorplan design

DAC '82 Proceedings of the 19th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approximation algorithm is presented for the efficient handling of large macro-cell placement problems. The algorithm combines simulated annealing with new features based on a hierarchical approach and a divide-and-conquer technique. Numerical results show that these features can lead to a considerable increase in efficiency of the placement algorithm without loss of effectiveness.