Constraint graph-based macro placement for modern mixed-size circuit designs

In this paper, we propose a constraint graph-based macro placement algorithm that removes macro overlaps and optimizes macro positions for modern mixed-size circuit designs. Improving over the constraint graph by working only on its essential edges without loss of the solution quality, our algorithm...

Full description

Saved in:
Bibliographic Details
Published in2008 IEEE/ACM International Conference on Computer-Aided Design pp. 218 - 223
Main Authors Hsin-Chen Chen, Yi-Lin Chuang, Yao-Wen Chang, Yung-Chung Chang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2008
Subjects
Algorithm design and analysis
Circuit synthesis
Cities and towns
Constraint optimization
Costs
Design engineering
Linear programming
Logic circuits
Logic design
System-on-a-chip
Online AccessGet full text

Cover

More Information
Summary:In this paper, we propose a constraint graph-based macro placement algorithm that removes macro overlaps and optimizes macro positions for modern mixed-size circuit designs. Improving over the constraint graph by working only on its essential edges without loss of the solution quality, our algorithm can search for high-quality macro placement solutions effectively and efficiently. Instead of packing macros along chip boundaries like most recent previous work, our placer can determine a non-compacted macro placement by linear programming and placement region cost evaluation and handle various placement constraints/objectives. Compared with various leading academic macro placers, our algorithm can consistently and significantly reduce the wirelengths for designs with different utilization rates, implying that our macro placer is robust and has very high quality.
ISBN:142442819X
9781424428199
ISSN:1092-3152
1558-2434
DOI:10.1109/ICCAD.2008.4681577