ABSTRACT
In this paper, we present a new hybrid representation of slicing trees and multi-packing trees, called multi-domain-packing trees (MDP-trees), for macro placement to handle ultra large-scale multi-domain mixed-size designs. A multi-domain design typically consists of a set of mixed-size domains, each with hundreds/thousands of large macros and (tens of) millions of standard cells, which is often seen in modern high-end applications (e.g., 4G LTE products and upcoming 5G ones). To the best of our knowledge, there is still no published work specifically tackling the domain planning and macro placement simultaneously. Based on binary trees, the MDP-tree is very efficient and effective for handling macro placement with multiple domains. Previous works on macro placement can handle only single-domain designs, which do not consider the global interactions among domains. In contrast, our MDP-trees plan domain regions globally, and optimize the interconnections among domains and macro/cell positions simultaneously. The placement area of each domain is well reserved, and the macro displacement is minimized from initial macro positions of the design prototype. Experimental results show that our approach can significantly reduce both the average half-perimeter wirelength and the average global routing wirelength.
- S. N. Adya, S. Chaturvedi, J. A. Roy, D. A. Papa, and I. L. Markov. Unification of partitioning, placement and floorplanning. In Proc. of ICCAD, pages 550--557, 2004. Google ScholarDigital Library
- T. F. Chan, J. Cong, J. Shinnerl, K. Sze, and M. Xie. mPL6: Enhanced multilevel mixed-size placement. In Proc. of ISPD, pages 212--214, 2006. Google ScholarDigital Library
- H.-C. Chen, Y.-L. Chuang, Y.-W. Chang, and Y.-C. Chang. Constraint graph-based macro placement for modern mixed-size circuit designs. In Proc. of ICCAD, pages 218--223, 2008. Google ScholarDigital Library
- T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang. NTUplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Tran. on CAD, 27(7):1228--1240, July 2008. Google ScholarDigital Library
- T.-C. Chen, P.-H. Yuh, Y.-W. Chang, F.-J. Huang, and D. Liu. MP-trees: A packing-based macro placement algorithm for mixed size designs. In Proc. of DAC, pages 447--452, 2007. Google ScholarDigital Library
- T.-C. Chen, P.-H. Yuh, Y.-W. Chang, F.-J. Huang, and T.-Y. Liu. MP-trees: A packing-based macro placement algorithm for modern mixed-size designs. IEEE Tran. on CAD, 27(9):1621--1634, September 2008. Google ScholarDigital Library
- Y.-F. Chen, C.-C. Huang, C.-H. Chiou, Y.-W. Chang, and C.-J. Wang. Routability-driven blockage-aware macro placement. In Proc. of DAC, pages 1--6, 2014. Google ScholarDigital Library
- C.-H. Chiou, C.-H. Chang, S.-T. Chen, and Y.-W. Chang. Circular-contour-based obstacle-aware macro placement. In Proc. of ASPDAC, pages 172--177, 2016.Google ScholarCross Ref
- J. Cong and M. Xie. A robust mixed-size legalization and detailed placement algorithm. IEEE Tran. on CAD, 27(8):1349--1362, August 2008. Google ScholarDigital Library
- M.-K. Hsu and Y.-W. Chang. Unified analytical global placement for large-scale mixed-size circuit designs. IEEE Tran. on CAD, 31(9):1366--1378, 2012. Google ScholarDigital Library
- M.-C. Kim, J. Hu, J. Li, and N. Viswanathan. ICCAD-2015 cad contest in incremental timing-driven placement and benchmark suite. In Proc. of ICCAD, pages 921--926, 2015. Google ScholarDigital Library
- M.-C. Kim, D.-J. Lee, and I. L. Markov. SimPL: An effective placement algorithm. In Proc. of ICCAD, pages 649--656, 2010. Google ScholarDigital Library
- M.-C. Kim and I. L. Markov. Complx: A competitive primal-dual lagrange optimization for global placement. In Proc. of DAC, pages 747--752, 2012. Google ScholarDigital Library
- M.-C. Kim, N. Viswanathan, C. J. Alpert, I. L. Markov, and S. Ramji. MAPLE: Multilevel adaptive placement for mixed-size designs. In Proc. of ISPD, pages 193--200, 2011. Google ScholarDigital Library
- J.-M. Lin, B.-H. Yu, and L.-Y. Chang. Regularity-aware routability-driven placement prototyping algorithm for hierarchical mixed-size circuits. In Proc. of ASPDAC, pages 438--443. IEEE, 2017.Google ScholarCross Ref
- J. Lu, H. Zhuang, P. Chen, H. Chang, C.-C. Chang, Y.-C. Wong, L. Sha, D. Huang, Y. Luo, C.-C. Teng, et al. eplace-ms: Electrostatics-based placement for mixed-size circuits. IEEE Tran. on CAD, 34(5):685--698, 2015.Google ScholarCross Ref
- Maxeda, Technology, Inc. http://www.maxeda.tech/.Google Scholar
- M. D. Moffitt, A. N. Ng, I. L. Markov, and M. E. Pollack. Constraint-driven floorplan repair. In Proc. of DAC, pages 1103--1108, 2006. Google ScholarDigital Library
- N. Viswanathan, M. Pan, and C. Chu. FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. of ASPDAC, pages 135--140, 2007. Google ScholarDigital Library
- D. Wong, H. W. Leong, and C. L. Liu. Simulated annealing for VLSI design. Kluwer Academic Publishers, 1988. Google ScholarDigital Library
- J. Z. Yan, N. Viswanathan, and C. Chu. Handling complexities in modern large-scale mixed-size placement. In Proc. of DAC, pages 436--441, 2009. Google ScholarDigital Library
- F. Y. Young and D. Wong. How good are slicing floorplans? Integration, the VLSI journal, 23(1):61--73, 1997. Google ScholarDigital Library
Index Terms
MDP-trees: multi-domain macro placement for ultra large-scale mixed-size designs
Recommendations
Routability-Driven Blockage-Aware Macro Placement
DAC '14: Proceedings of the 51st Annual Design Automation ConferenceWe present a new floorplan representation, called circular-packing trees (CP-trees), for the problem of macro placement. Our CP-trees can flexibly pack movable macros toward corners or pre-placed macros along chip boundaries circularly to optimize macro ...
MP-trees: a packing-based macro placement algorithm for mixed-size designs
DAC '07: Proceedings of the 44th annual Design Automation ConferenceIn this paper, we present a new multi-packing tree (MP-tree) representation for macro placement to handle mixed-size designs. Based on binary trees, the MP-tree is very efficient, effective, and flexible for handling macro placement with various ...
MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...
Comments