skip to main content
10.1145/2984393.2984409acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesseeda-cecnsmConference Proceedingsconference-collections
research-article

Heuristics for Iterative Detailed Standard Cell Placement

Published: 25 September 2016 Publication History

Abstract

In cell placement a number of cells with rectangular shapes, must be placed inside a chip area so that no cells overlap and a target function is optimized. In standard cell placement all rectangles have the same width and the chip area is split into rows of equivalent width. Cells must be placed inside rows without overlaps and without exceeding row boundaries. A final solution is obtained using at least two stages. In the first stage, often called global placement, cells are distributed so as to optimize the target function. This initial distribution might violate problem constraints, therefore at a second stage often referred to as detailed placement cells are assigned to rows and overlaps are alleviated. In this paper we focus on heuristics in the context of iterative detailed placement whereby after assigning cells to rows, an iterative process further improves the optimization function, in our case wire length. The basis of the search mechanism is cell swapping. Through experimental evaluation we identify useful trade-offs between solution quality and execution time for the proposed search methods.

References

[1]
Adya, S. N., Markov, I. L., and Villarrubia, P. G. 2003. On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis. In Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (San Jose, CA, USA, Nov 9-13, 2003). ICCAD '03. IEEE Computer Society, Washington, DC, USA, 311--318. DOI=http://dx.doi.org/10.1109/ICCAD.2003.107
[2]
Agnihotri, A., Yildiz, M. C., Khatkhate, A., Mathur, A., Ono, S., and Madden, P. H. 2003. Fractional cut: Improved recursive bisection placement. In Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (San Jose, CA, USA, Nov 9-13, 2003). ICCAD '03. IEEE Computer Society, Washington, DC, USA, 307--310. DOI= http://dx.doi.org/10.1109/ICCAD.2003.1257685
[3]
Alpert, C. J., Gandham, G., Hrkić, M., Hu, J., and Quay, S. T. 2003. Porosity aware buffered steiner tree construction. In Proceedings of the 2003 international symposium on Physical design. (Monterey, CA, USA, April 06-09, 2003).ISPD '03. ACM, New York, NY, USA, 158--165. DOI=http://dx.doi.org/10.1145/640000.640035
[4]
Aziz, M. A., Khan, S.U., Loukopoulos, T., Bouvry, P., Li, H., and Li, J. 2010. An overview of achieving energy efficiency in on-chip networks. Int. J. Commun. Netw. Distrib. Syst. 5, 4 (September 2010), 444--458. DOI=http://dx.doi.org/10.1504/IJCNDS.2010.035560
[5]
Brenner, U. 2012. VLSI legalization with minimum perturbation by iterative augmentation. In Proceedings of the Conference on Design, Automation and Test in Europe.(Dresden, Germany, March, 12-16, 2012). DATE '12. EDA Consortium, San Jose, CA, USA, 1385--1390. DOI=http://dx.doi.org/10.1109/DATE.2012.6176579
[6]
Brenner, U., Struzyna, M., and Vygen, J. 2008. BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms. Trans. Comp.-Aided Des. Integ. Cir. Sys. 27, 9 (September 2008), 1607--1620. DOI=http://dx.doi.org/10.1109/TCAD.2008.927674
[7]
Brenner, U. and Vygen, J. 2000. Faster optimal single-row placement with fixed ordering. In Proceedings of the conference on Design, automation and test in Europe. (Paris, France, March, 27-30, 2000). DATE '00. ACM, New York, NY, USA, 117--121. DOI=http://dx.doi.org/10.1145/343647.343716
[8]
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. DOI=http://dx.doi.org/10.1109/TCAD.2004.836733
[9]
Brglez, F., Bryan, D. and Kozminski, K. 1989. Combinational profiles of sequential benchmark circuits. In Proceeding of the IEEE International Symposium on Circuits and Systems. (Portland, OR, May, 8-11, 1989). ISCAS. 1929--1934. DOI=http://dx.doi.org/10.1109/ISCAS.1989.100747
[10]
Caldwell, A. E., Kahng, A. B., and Markov, I. L. 1999. Optimal partitioners and end-case placers for standard-cell layout. In Proceedings of the 1999 international symposium on Physical design. (Monterey, CA, April 12-14, 1999). ISPD '99. ACM, New York, NY, USA, 90--96. DOI=http://dx.doi.org/10.1145/299996.300032
[11]
Chan, T. F., Cong, J., Shinnerl, J. R., Sze, K., and Xie, M. 2006. mPL6: enhanced multilevel mixed-size placement. In Proceedings of the 2006 international symposium on Physical design. (San Jose, CA, April 9-12, 2006). ISPD '06. ACM, New York, NY, USA, 212--214. DOI=http://doi.acm.org/10.1145/1123008.1123055
[12]
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. DOI=http://dx.doi.org/10.1109/TCAD.2008.923063
[13]
Cho, M., Ren, H., Xiang, H., and Puri, R. 2010. History-based VLSI legalization using network flow. In Proceedings of the 47th Design Automation Conference. (Anaheim, CA, June 13-18, 2010). DAC '10. ACM, New York, NY, USA, 286--291. DOI=http://dx.doi.org/10.1145/1837274.1837347
[14]
Cong, J. and Xie, M. 2006. A robust detailed placement for mixed-size IC designs. In Proceedings of the 2006 Asia and South Pacific Design Automation Conference. (Yokohama, Japan, Jan 23-26, 2007). ASP-DAC'07. 188--194. DOI=http://dx.doi.org/10.1109/ASPDAC.2006.1594680
[15]
Doll, K., Johannes, F. M., and Antreich, K. J. 2006. Iterative placement improvement by network flow methods. Trans. Comp.-Aided Des. Integ. Cir. Sys. 13, 10 (November 2006), 1189--1200. DOI=http://dx.doi.org/10.1109/43.317462
[16]
Hill, D. 2002. Method and system for high speed detailed placement of cells within an integrated circuit design. US 6370673 B1. 2002.
[17]
Ho, T.-Y., Liu, S.-H., and Tseng S.-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. DOI=http://dx.doi.org/10.1109/VLSISOC.2010.5642689
[18]
Hur, S. W. and Lillis, J. 2000. Mongrel: hybrid techniques for standard cell placement. In Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design. (San Jose, CA, USA, 2000). ICCAD '00. 165--170. DOI=http://dx.doi.org/10.1109/ICCAD.2000.896468
[19]
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. DOI=http://dx.doi.org/10.1145/988952.989004
[20]
Kim, M-C., Hu, J., Lee, D-J., and Markov, I. L. 2011. A SimPLR method for routability-driven placement. In Proceedings of the International Conference on Computer-Aided Design. (San Jose, CA, NOV 7-10, 2011). ICCAD '11. IEEE Press, Piscataway, NJ, USA, 67--73. DOI=http://dx.doi.org/10.1109/ICCAD.2011.6105307
[21]
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. DOI=http://dx.doi.org/10.1109/43.67789
[22]
Koziri, M. and Eleftheriadis, A. 2010. Joint quantizer optimization for scalable coding. In Proceedings of the IEEE International Conference on Image Processing. (Hong Kong, Sep 26-29, 2010). ICIP'10. 1281--1284. DOI=http://dx.doi.org/10.1109/ICIP.2010.5653282
[23]
Koziri, M., Zacharis, D., Katsavounidis, I., and N. Bellas. 2011. Implementation of the AVS video decoder on a heterogeneous dual-core SIMD processor. IEEE Transactions on Consumer Electronics. 57,2 (May 2011), 673--681. DOI=http://dx.doi.org/10.1109/TCE.2011.5955207
[24]
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, Jan 18-21, 2010). ASPDAC '10. IEEE Press, Piscataway, NJ, USA, 568--573. DOI=http://dx.doi.org/10.1109/ASPDAC.2010.5419819
[25]
Loukopoulos, T., Tziritas, N., Lampsas, P., and Lalis, S. 2007. Implementing replica placements: feasibility and cost minimization. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium. (Long Beach, CA, March 26-30, 2007). IPDPS'O7. DOI=http://dx.doi.org/10.1109/IPDPS.2007.370316
[26]
Markov, I.L., Hu, J., and Kim, M-C. 2012. Progress and challenges in VLSI placement research. In Proceedings of the International Conference on Computer-Aided Design. (San Jose, CA, Nov 5-8, 2012). ICCAD '12. ACM, New York, NY, USA, 275--282. DOI=http://dx.doi.org/10.1145/2429384.2429441
[27]
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, Oct 01-03, 2015). PCI '15. ACM, New York, NY, USA, 86--91. DOI=http://dx.doi.org/10.1145/2801948.2801965
[28]
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. DOI=http://dx.doi.org/10.1145/1353629.1353640
[29]
Spindler P., Schlichtmann, U., and Johannes, F. M. 2008. Kraftwerk2 - A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27, 8 (Aug. 2008), 1398--1411. DOI=http://dx.doi.org/10.1109/TCAD.2008.925783
[30]
Tziritas, N., Khan, S. U., Loukopoulos, T., Lalis, S., Xu, C. Z., and Lampsas, P. 2014. Single and group agent migration: Algorithms, bounds, and optimality issues. IEEE Transactions on Computers. 63, 12. (Dec. 2008), 3143--3161.
[31]
Tziritas, N., Loukopoulos, T., Khan, S. U., and Xu, C. Z. 2015. Distributed Algorithms for the Operator Placement Problem. IEEE Transactions on Computational Social Systems. 2,4 (Dec. 2015), 182--196. DOI=http://dx.doi.org/10.1109/TCSS.2016.2519503
[32]
Viswanathan, N., Pan, M., and Chu, C. 2007. FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control. In Proceedings of the 2007 Asia and South Pacific Design Automation Conference. (Yokohama, Japan, Jan 23-26 2007). ASP-DAC '07. IEEE Computer Society, Washington, DC, USA, 135--140. DOI=http://dx.doi.org/10.1109/ASPDAC.2007.357975.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
SEEDA-CECNSM '16: Proceedings of the SouthEast European Design Automation, Computer Engineering, Computer Networks and Social Media Conference
September 2016
126 pages
ISBN:9781450348102
DOI:10.1145/2984393
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: 25 September 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Detailed cell placement
  2. Gordian
  3. Heuristics
  4. Legalization
  5. Tetris

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

SEEDA-CECNSM '16

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 55
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025

Other Metrics

Citations

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