skip to main content
10.1145/3003733.3003778acmotherconferencesArticle/Chapter ViewAbstractPublication PagespciConference Proceedingsconference-collections
research-article

Performance Evaluation of Tetris-based Legalization Heuristics

Authors Info & Claims
Published:10 November 2016Publication History

ABSTRACT

Algorithms for standard cell placement legalization have attracted significant research efforts in the past. A prominent member of this category is the Tetris algorithm which is a simple and particularly fast method for legalizing an initial placement containing overlaps. In the relevant literature sophisticated legalization schemes were proposed using Tetris as a performance yardstick. In order to achieve better performance such schemes usually sacrifice the fast running time of Tetris by a large margin. In this paper we turn our focus on simple Tetris variations that improve performance without seriously compromising running time. Specifically, we present five generic heuristic variations of the initial Tetris algorithm. Through experimental evaluation we conclude on the merits of each approach.

References

  1. Aziz, M., Khan, S.U., Loukopoulos, T., Bouvry, P., Li, H., and Li J. 2010. International Journal of Communication Networks and Distributed Systems. 5, 4 (Sept. 2010), 444--458. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Brenner, U. 2013. BonnPlace Legalization: Minimizing Movement by Iterative Augmentation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 32, 8 (Aug. 2013), 1215--1227. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Brenner, U., Pauli, A. and Vygen, J. 2004. Almost optimum placement legalization by minimum cost flow and dynamic programming. In Proceedings of the 2004 International Symposium on Physical design (Phoenix, USA, April 18-21, 2004). ISPD '04. ACM, New York, NY, USA, 2--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Brenner, U. and Struzyna, M. 2005. Faster and better global placement by a new transportation algorithm. In Proceedings of the 42nd Design Automation Conference (Anaheim, USA, June 13-17, 2005). DAC '05. ACM, New York, NY, USA, 591--596. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Brenner, U. and Vygen, J. 2006. Legalizing a placement with minimum total movement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 23, 12 (Nov. 2006), 1597--1613. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chang, C.C., Cong, J., Pan, Z., and Yuan, X. 2003. Multilevel global placement with congestion control. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 22, 4 (Apr. 2003), 395--409. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Chen, T. C., Jiang, Z.W., Hsu, T. C., Chen, H.C. and Chang, Y. W. 2008. NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27, 7 (Jul. 2008), 1228--1240. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Chou, S. and Ho, T.-Y. 2009. OAL: An Obstacle-Aware Legalization in Standard Cell Placement with Displacement Minimization. In Proceedings of IEEE International SOC Conference (Belfast, Northern Ireland, September 09-11, 2009). SOCC'09. 329--332.Google ScholarGoogle Scholar
  9. Darav, N. K., Kennings, A., Westwick, D. and Behjat, L. 2015. High Performance Global Placement and Legalization Accounting for Fence Regions. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (Austin, USA, November 02-06, 2015). ICCAD '15. IEEE Press, Piscataway, NJ, USA, 514--519. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Eisenmann, H. and Johannes, F.M. 1998. Generic global placement and floorplanning. In Proceedings of the 35th annual Design Automation Conference (San Francisco, USA, June 15-19, 1998). DAC '98. ACM, New York, NY, USA, 269--274. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Hill, D. 2002. Method and system for high speed detailed placement of cells within an integrated circuit design. US 6370673 B1. 2002.Google ScholarGoogle Scholar
  12. Ho, T.-Y., Liu, S.-H. and TsengS.-M. 2010. Fast Legalization for Standard Cell Placement with Simultaneous Wirelength and Displacement Minimization. In Proceedings of IEEE/IFIP International Conference on VLSI and System-on- Chip (Madrid, Spain, September 27-29, 2010). VLSISOC'10. IEEE, 369--374.Google ScholarGoogle Scholar
  13. Huang, C.C., Chiou, C.H., Tseng, K.H. and Chang, Y. W. 2015. Detailed-Routing-Driven analytical standard-cell placement. In Proceedings of the 20th Asia and South Pacific Design Automation Conference (Chiba, Japan, January 19-22, 2015). ASPDAC'15. IEEE, 378--383.Google ScholarGoogle Scholar
  14. Kahng, A. B., Markov, I. L. and Reda, S. 2004. On legalization of row-based placements. In Proceedings of the 14th ACM Great Lakes Symposium on VLSI (Boston, USA, April 26-28, 2004). GLSVLSI '04. ACM, New York, NY, USA, 214--219. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Koziri, M., Dadaliaris, A. N., Stamoulis, G. I., and Katsavounidis, I. 2007. A Novel Low-Power Motion Estimation Design for H.264. In Proceedings of the IEEE Int. Conf. on Application-specific Systems, Architectures and Processors (Montreal, Canada, July 8-11, 2007). ASAP '07, 247--252.Google ScholarGoogle Scholar
  16. Koziri, M., Stamoulis, G.I., and Katsavounidis, I. 2006. Power Reduction in an H.264 Encoder through Algorithmic and Logic Transformations. In Proceedings of the International Symposium on Low Power Electronics and Design (Tegernsee, Germany, Oct. 4-6, 2006). ISLPED '06, 107--112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Kleinhans, J. M., Sigl, G., Johannes, F. M. and Antreich K. J. 1991. GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10, 3 (Mar. 1991), 356--365. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lee, Y.-M., Wu, T.-Y., and Chiang, P.-Y. 2010. A hierarchical bin-based legalizer for standard-cell designs with minimal disturbance. In Proceedings of the 2010 Asia and South Pacific Design Automation Conference (Taipei, Taiwan, January 18-21, 2010). ASPDAC '10. IEEE Press, Piscataway, NJ, USA, 568--573. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Li, C., Xie, M., Koh, C.K., Cong, J. and Madden P. H. 2004. Routability-driven placement and white space allocation. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (San Jose, USA, November 07-11, 2004). ICCAD '04. IEEE Computer Society, Washington, DC, USA, 394--401. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Lin, T., Chu, C. and Wu, G. 2015. POLAR 3.0: An Ultrafast Global Placement Engine. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (Austin, USA, November 02-06, 2015). ICCAD '15. IEEE Press, Piscataway, NJ, USA, 520--527. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Luo, T. and Pan, D. Z. 2008. DPlace2.0: A stable and efficient analytical placement based on diffusion. In Proceedings of the 2008 Asia and South Pacific Design Automation Conference (Seoul, South Korea, March 21-24, 2008). ASPDAC'08. IEEE, 346--351. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Luo, T., Ren, H., Alpert, C. J. and Pan, D. Z. 2005. Computational geometry based placement migration. In Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design. ICCAD '05. IEEE Computer Society, Washington, DC, USA, 41--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Oikonomou, P., Loukopoulos, T., Dadaliaris, A.N., Koziri, M.G. and Stamoulis, G.I. 2015. On formulating and tackling integrated circuit placement as a scheduling problem. In Proceedings of the 19th Panhellenic Conference on Informatics (Athens, Greece, October 01-03, 2015). PCI '15. ACM, New York, NY, USA, 86--91. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Popovych, S., Lai, H.-H., Wang, C.-M., Li, Y.-L., Liu, W.-H. and Wang, T.-C. 2014. Density-aware Detailed Placement with Instant Legalization. In Proceedings of the 51st Annual Design Automation Conference (San Francisco, USA, June 1-5, 2014). DAC'14. ACM, New York, NY, USA, 1--6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Puget, J. C., Flach, G., Reis, R. and Johann, M. 2015. Jezz: An effective legalization algorithm for minimum displacement. In Proceedings of the 28th Symposium on Integrated Circuits and Systems Design (Salvador, Brazil, August 31-September 4, 2015). SBCCI '15. ACM, New York, NY, USA, 1--5. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Sarrafzadeh, M. and Wang, M. 1997. NRG: global and detailed placement. In Proceedings of the 1997 IEEE/ACM International Conference on Computer Aided Design (San Jose, USA, November 09-13, 1997). ICCAD '97.IEEE Computer Society, Washington, DC, USA, 532--537. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Spindler, P., Schlichtmann, U. and Johannes, F. M. 2008. Abacus: fast legalization of standard cell circuits with minimal movement. In Proceedings of the 2008 International Symposium on Physical Design (Portland, USA, April 13-16, 2008). ISPD '08. ACM, New York, NY, USA, 47--53. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Spindler P., Schlichtmann, U. and Johannes, F. M. 2008. Kraftwerk2 - A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model. in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27, 8 (Aug. 2008), 1398--1411. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Taghavi, T., Yang, X. and Choi, B. 2005. Dragon2005. In Proceedings of the 2005 International Symposium on Physical Design (San Francisco, USA, April 3-6, 2005). ISPD '05. ACM, New York, NY, USA, 245--247. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Viswanathan, N. and Chu, C.C.-N. 2006. FastPlace: efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 24, 5 (Nov. 2006), 722--733. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

(auto-classified)
  1. Performance Evaluation of Tetris-based Legalization Heuristics

      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 Other conferences
        PCI '16: Proceedings of the 20th Pan-Hellenic Conference on Informatics
        November 2016
        449 pages
        ISBN:9781450347891
        DOI:10.1145/3003733

        Copyright © 2016 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: 10 November 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

        Acceptance Rates

        Overall Acceptance Rate190of390submissions,49%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader