Referenced Items are not available for this document.
We show experimentally that the number of clustering levels in a multilevel circuit partitioning algorithm may be reduced if guided by a measure of regularity applied to the input circuit netlist. Furthermore, we devise a simple tactic to reduce the number of runs in a multistart circuit partitioning algorithm. As a consequence CPU-time is saved. This comes at only a minor degradation in solution cost. Experiments were performed by applying our algorithm MLAF to the ISPD-98 benchmarks
Published in:
Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on
(Volume:1
)
Date of Conference: 2000
- Page(s):
- 416 - 419 vol.1
- Meeting Date :
- 17 Dec 2000-20 Dec 2000
- Print ISBN:
- 0-7803-6542-9
- INSPEC Accession Number:
- 6931381
- Conference Location :
- Jounieh
- Digital Object Identifier :
- 10.1109/ICECS.2000.911569
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
