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

Analytical Mixed-Cell-Height Legalization Considering Average and Maximum Movement Minimization

Published:04 April 2019Publication History

ABSTRACT

Modern circuit designs often contain standard cells of different row heights to meet various design requirements. Due to the higher interference among heterogeneous cell structures, the legalization problem for mixed-cell-height standard cells becomes more challenging. In this paper, we present an analytical legalization algorithm for mixed-cell-height standard cells to simultaneously minimize the average and the maximum cell movements. We formulate it as a mixed integer quadratic programming problem (MIQP), which allows cell spreading concurrently in both the horizontal and vertical directions. By relaxing its discrete constraints to linear ones, we convert the MIQP into a quadratic programming problem (QP). To solve the QP efficiently, we further reformulate it as a linear complementarity problem (LCP), and solve the LCP by a modulus-based matrix splitting iteration method (MMSIM). To guarantee the convergence of the MMSIM and the equivalence between the QP and the LCP, we use a series of operations to ensure that its induced objective matrix is symmetric positive definite and its constraint matrix is of full row rank. Experimental results demonstrate the effectiveness of our algorithm in reducing both the average and the maximum cell movements for mixed-cell-height legalization.

References

  1. CPLEX. (2018 May) {Online}. Available: http://www-01.ibm.com.Google ScholarGoogle Scholar
  2. S. H. Baek, H. Y. Kim, Y. K. Lee, D. Y. Jin, S. C. Park, and J. D. Cho. Ultra high density standard cell library using multi-height cell structure. In Proceedings of SPIE 7268, pages 72680C--72680C, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  3. Z. Z. Bai. Modulus-based matrix splitting iteration methods for linear complementarity problems. Numerical Linear Algebra with Applications, 17(6):917--933, December 2010.Google ScholarGoogle ScholarCross RefCross Ref
  4. U. Brenner. Bonnplace legalization: Minimizing movement by iterative augmentation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(8):1215--1227, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Chen, Z. Zhu, W. Zhu, and Y.-W. Chang. Toward optimal legalization for mixed-cell-height circuit designs. In Proceedings of ACM/IEEE Design Automation Conference, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Cho, H. Ren, H. Xiang, and R. Puri. History-based VLSI legalization using network flow. In Proceedings of ACM/IEEE Design Automation Conference, pages 286--291, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. W.-K. Chow, C.-W. Pui, and E. F. Y. Young. Legalization algorithm for multiplerow height standard cell design. In Proceedings of ACM/IEEE Design Automation Conference, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. K. Darav, I. S. Bustany, A. Kennings, and L. Behjat. A fast, robust network flow-based standard-cell legalization method for minimizing maximum movement. In Proceedings of ACM International Symposium on Physical Design, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. N. K. Darav, I. S. Bustany, A. Kennings, and R. Mamidi. ICCAD-2017 CAD Contest in multi-deck standard cell legalization and benchmarks suite. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N. K. Darav, A. Kennings, A. F. Tabrizi, D. Westwick, and L. Behjat. Eh?placer: A high-performance modern technology-driven placer. ACM Transactions on Design Automation of Electronic Systems, 21(3):37:1--37:27, April 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Dobre, A. B. Kahng, and J. Li. Mixed cell-height implementation for improved design quality in advanced nodes. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 854--860, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C.-Y. Hung, P.-Y. Chou, and W.-K. Mak. Mixed-cell-height standard cell placement legalization. In Proceedings of Great Lakes Symposium on VLSI, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. B. Kahng, I. L. Markov, and S. Reda. On legalization of row-based placements. In Proceedings of Great Lakes Symposium on VLSI, pages 214--219, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Munkres. Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1):32--38, March 1957.Google ScholarGoogle ScholarCross RefCross Ref
  15. J. Nocedal and S. J. Wright. Numerical optimization. New York: Springer, 2006.Google ScholarGoogle Scholar
  16. C.-H. Wang, Y.-Y. Wu, J. Chen, Y.-W. Chang, S.-Y. Kuo, W. Zhu, and G. Fan. An effective legalization algorithm for mixed-cell-height standard cells. In Proceedings of IEEE/ACM Asia and South Pacific Design Automation Conference, 2017.Google ScholarGoogle ScholarCross RefCross Ref
  17. G.Wu and C. Chu. Detailed placement algorithm for VLSI design with double-row height standard cells. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 35(9):1569--1573, 2015.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    ISPD '19: Proceedings of the 2019 International Symposium on Physical Design
    April 2019
    164 pages
    ISBN:9781450362535
    DOI:10.1145/3299902

    Copyright © 2019 ACM

    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]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 4 April 2019

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    ISPD '19 Paper Acceptance Rate12of25submissions,48%Overall Acceptance Rate62of172submissions,36%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader