skip to main content
10.1145/1735023.1735066acmconferencesArticle/Chapter ViewAbstractPublication PagesispdConference Proceedingsconference-collections
research-article

SafeChoice: a novel clustering algorithm for wirelength-driven placement

Published: 14 March 2010 Publication History

Abstract

This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, safe condition which guarantees that clustering would not degrade the placement wirelength. To derive such a theorem, we first introduce the concept of safe clustering, i.e., do clustering without degrading the placement quality. To check the safe condition for pair-wise clustering, we propose selective enumeration technique. SC maintains a global priority queue (PQ) based on the safeness and area of potential clusters. Iteratively the cluster at the top of the PQ is formed. SC automatically stops clustering when generating more clusters would degrade the placement wirelength. To achieve other clustering objectives, e.g., any target clustering ratio, SC is able to perform under three different modes. Comprehensive experimental results show that the clusters produced by SC consistently help the placer to achieve the best wirelength among all other clustering algorithms.

References

[1]
T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang. A high-quality mixed-size analytical placer considering preplaced blocks and density constraints. In Proc. ICCAD, pages 187--192, 2006.
[2]
J. A. Roy, S. N. Adya, D. A. Papa, and I. L. Markov. Min-cut floorplacement. IEEE Trans. on Computer-Aided Design, 25(7):1313--1326, July 2006.
[3]
B. Hu and M. Marek-Sadowska. Multilevel fixed-point-addition-based vlsi placement. IEEE Trans. on Computer-Aided Design, 24(8):1188--1203, August 2005.
[4]
A. B. Kahng and Q. Wang. A faster implementation of APlace. In Proc. ISPD, pages 218--220, 2006.
[5]
T. Chan, J. Cong, J. Shinnerl, K. Sze, and M. Xie. mPL6: Enhanced multilevel mixed-sized placement. In Proc. ISPD, pages 212--214, 2006.
[6]
N. Viswanathan, M. Pan, and C. Chu. FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. ASP-DAC, pages 135--140, 2007.
[7]
N. Viswanathan, G.-J. Nam, C. Alpert, P. Villarrubia, H. Ren, and C. Chu. RQL: Global placement via relaxed quadratic spreading and linearization. In Proc. DAC, pages 453--458, 2007.
[8]
C. J. Alpert and A. B. Kahng. Recent developments in netlist partitioning: A survey. Integration, the VLSI Journal, 19(1--2):1--81, August 1995.
[9]
G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: application in VLSI domain. In Proc. DAC, pages 526--529, 1997.
[10]
G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. In Proc. DAC, pages 343--348, 1999.
[11]
C. J. Alpert, J.-H. Huang, and A. B. Kahng. Multilevel k-way hypergraph partitioning. In Proc. DAC, pages 530--533, 1997.
[12]
T. Chan, J. Cong, and K. Sze. Multilevel generalized force-directed method for circuit placement. In Proc. ISPD, pages 185--192, 2005.
[13]
J. Cong and S. K. Lim. Edge separability-based circuit clustering with application to multilevel circuit partitioning. IEEE Trans. on Computer-Aided Design, 23(3):346--357, March 2004.
[14]
B. Hu and M. Marek-Sadowska. Fine granularity clustering-based placement. IEEE Trans. on Computer-Aided Design, 23(4):527--536, April 2004.
[15]
G.-J. Nam, S. Reda, C. J. Alpert, P. G. Villarrubia, and A. B. Kahng. A fast hierarchical quadratic placement algorithm. IEEE Trans. on Computer-Aided Design, 25(4):678--691, April 2006.
[16]
J. Li, L. Behjat, and J. Huang. An effective clustering algorithm for mixed--size placement. In Proc. ISPD, pages 111--118, 2007.
[17]
G.-J. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz. The ISPD2005 placement contest and benchmarks suite. In Proc. ISPD, pages 216--220, 2005.
[18]
G.-J. Nam. ISPD 2006 placement contest: Benchmark suite and results. In Proc. ISPD, pages 167--167, 2006.
[19]
SafeChoice source code. \newline http://www.public.iastate.edu/ zijunyan/.

Cited By

View all
  • (2020)A hybrid bio-inspired optimisation approach for wirelength minimisation of hardware tasks placement in field programmable gate array devicesInternational Journal of Bio-Inspired Computation10.1504/ijbic.2020.10644915:2(125-134)Online publication date: 1-Jan-2020
  • (2017)Hierarchical and Analytical Placement Techniques for High-Performance Analog CircuitsProceedings of the 2017 ACM on International Symposium on Physical Design10.1145/3036669.3036678(55-62)Online publication date: 19-Mar-2017
  • (2016)Design for Manufacturability with E-Beam LithographyDesign for Manufacturability with Advanced Lithography10.1007/978-3-319-20385-0_5(111-157)Online publication date: 2016
  • Show More Cited By

Index Terms

  1. SafeChoice: a novel clustering algorithm for wirelength-driven placement

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ISPD '10: Proceedings of the 19th international symposium on Physical design
      March 2010
      220 pages
      ISBN:9781605589206
      DOI:10.1145/1735023
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      In-Cooperation

      • IEEE CAS

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 14 March 2010

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. hypergraph clustering
      2. physical design
      3. vlsi placement

      Qualifiers

      • Research-article

      Conference

      ISPD '10
      Sponsor:
      ISPD '10: International Symposium on Physical Design
      March 14 - 17, 2010
      California, San Francisco, USA

      Acceptance Rates

      ISPD '10 Paper Acceptance Rate 22 of 70 submissions, 31%;
      Overall Acceptance Rate 62 of 172 submissions, 36%

      Upcoming Conference

      ISPD '25
      International Symposium on Physical Design
      March 16 - 19, 2025
      Austin , TX , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 12 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)A hybrid bio-inspired optimisation approach for wirelength minimisation of hardware tasks placement in field programmable gate array devicesInternational Journal of Bio-Inspired Computation10.1504/ijbic.2020.10644915:2(125-134)Online publication date: 1-Jan-2020
      • (2017)Hierarchical and Analytical Placement Techniques for High-Performance Analog CircuitsProceedings of the 2017 ACM on International Symposium on Physical Design10.1145/3036669.3036678(55-62)Online publication date: 19-Mar-2017
      • (2016)Design for Manufacturability with E-Beam LithographyDesign for Manufacturability with Advanced Lithography10.1007/978-3-319-20385-0_5(111-157)Online publication date: 2016
      • (2015)POLAR: A High Performance Mixed-Size Wirelengh-Driven Placer With Density ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2015.239438334:3(447-459)Online publication date: Mar-2015
      • (2013)LatchPlannerProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561898(342-348)Online publication date: 18-Nov-2013
      • (2013)LatchPlanner: Latch placement algorithm for datapath-oriented high-performance VLSI designs2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)10.1109/ICCAD.2013.6691141(342-348)Online publication date: Nov-2013
      • (2012)Line search-based inverse lithography technique for mask designVLSI Design10.1155/2012/5891282012(1-1)Online publication date: 1-Jan-2012
      • (2012)A new length-based algebraic multigrid clustering algorithmVLSI Design10.1155/2012/3952602012(8-8)Online publication date: 1-Jan-2012
      • (2012)An algebraic multigrid-based algorithm for circuit clusteringApplied Mathematics and Computation10.1016/j.amc.2011.10.084218:9(5202-5216)Online publication date: Jan-2012
      • (2011)SafeChoiceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2011.211495030:7(1020-1033)Online publication date: 1-Jul-2011

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media