A new clustering approach and its application to BBL placement

Authors:
M. Y. Yu;X. L. Hong;Y. E. Lien;Z. Z. Ma;J. G. Bo;W. J. Zhuang
Affiliations:
Software Laboratory, Academia Sinica;Tsinghua University, Beijing;Peking University, Beijing;Software Laboratory, Academia Sinica;Software Laboratory, Academia Sinica;Software Laboratory, Academia Sinica
Venue:
EURO-DAC '90 Proceedings of the conference on European design automation
Year:
1990

Citing 2
Cited 2

Chip-planning, placement, and global routing of macro/custom cell integrated circuits using simulated annealing

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Clustering and linear placement

DAC '72 Proceedings of the 9th Design Automation Workshop

An effective general connectivity concept for clustering

Proceedings of the conference on Design, automation and test in Europe
Speedup improvement on general connectivity computation by algorithmic techniques and parallel processing

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach for clustering applied to Building Block placement is presented. Unlike traditional approaches, which only consider local factors such as connectivity and shape matching of blocks in a cluster, our approach (called the GAC method) not only considers connectivity and shape matching of clustering, but also takes a more important factor, global analyses, into account. Furthermore, in this paper we have proposed a new shape matching and a propagating method to compute the connectivity of clusters. The new method makes connectivity computation more precisely. This clustering algorithm has been implemented in Fortran 77 on Micro VAX II. The experimental placement results are much better than BEAR and Timber WolfMC, the latter of which adopts the simulated annealing approach, and the GAC method has a much better run time.