Abstract
In this article we propose an effective algorithm flow to handle modern large-scale mixed-size placement, both with and without geometry constraints. The basic idea is to use floorplanning to guide the placement of objects at the global level. The flow consists of four steps: (1) The objects in the original netlist are clustered into blocks; (2) floorplanning is performed on the blocks; (3) the blocks are shifted within the chip region to further optimize the wirelength; (4) with large macro-locations fixed, incremental placement is applied to place the remaining objects. There are several advantages to handling placement at the global level with a floorplanning technique. First, the problem size can be significantly reduced. Second, exact Half-Perimeter WireLength (HPWL) can be minimized. Third, better object distribution can be achieved so that legalization only needs to handle minor overlaps among small objects in a block. Fourth, macro-rotation and various geometry constraints can be handled. To demonstrate the effectiveness of this new flow, we implement a high-quality and efficient floorplan-guided placer called FLOP. We also construct the Modern Mixed-Size (MMS) placement benchmarks that can effectively represent the complexities of modern mixed-size designs and the challenges faced by modern mixed-size placers. Compared with most state-of-the-art mixed-size placers and leading macroplacers, experimental results show that FLOP achieves the best HPWL and easily obtains legal solutions on all circuits with all geometry constraints satisfied.
- S. N. Adya, S. Chaturvedi, J. A. Roy, D. A. Papa, and I. L. Markov. 2004. Unification of partitioning, placement and floorplanning. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'04). 550--557. Google ScholarDigital Library
- S. N. Adya and I Markov. 2005. Combinatorial techniques for mixed-size placement. ACM Trans. Des. Autom. Electron. Syst. 10, 1, 58--90. Google ScholarDigital Library
- T. Chan, J. Cong, J. Shinnerl, K. Sze, and M. Xie. 2006. mPL6: Enhanced multilevel mixed-sized placement. In Proceedings of the International Symposium on Physical Design (ISPD'06). 212--214. Google ScholarDigital Library
- H.-C. Chen, Y.-L. Chuang, Y.-W. Chang, and Y.-C. Chang. 2008. Constraint graph-based macro placement for modern mixed-size circuit designs. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'08). 218--223. Google ScholarDigital Library
- T.-C. Chen, Y.-W. Chang, and S.-C. Lin. 2005. IMF: Interconnect-driven multilevel floorplanning for large-scale building-module designs. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'05). 159--164. Google ScholarDigital Library
- T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang. 2006. A high-quality mixed-size analytical placer considering preplaced blocks and density constraints. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'06). 187--192. Google ScholarDigital Library
- T.-C. Chen, P.-H. Yuh, Y.-W. Chang, F.-J. Huang, and D. Liu. 2007. MP-tree: A packing-based macro placement algorithm for mixed-size designs. In Proceedings of the 44th Annual Design Automation Conference (DAC'07). 447--452. Google ScholarDigital Library
- J. Cong and M. Xie. 2006. A robust detailed placement for mixed-size IC designs. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'06). 188--194. Google ScholarDigital Library
- J. Egeblad. 2003. Placement techniques for VLSI layout using sequence-pair legalization. Ph.D. dissertation. http://www.diku.dk/∼jegeblad/thesis.pdf.Google Scholar
- P.-N. Guo, C.-K. Cheng, and T. Yoshimura. 1999. An o-tree representation of non-slicing floorplan and its applications. In Proceedings of the 36th Design Automation Conference (DAC'99). 268--273. Google ScholarDigital Library
- M.-K. Hsu and Y.-W. Chang. 2010. Unified analytical global placement for large-scale mixed-size circuit designs. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'10). 657--662. Google ScholarDigital Library
- A. B. Kahng and Q. Wang. 2005. Implementation and extensibility of an analytical placer. IEEE Trans. Comput.-Aid. Des. 24, 5, 734--747. Google ScholarDigital Library
- A. B. Kahng and Q. Wang. 2006. A faster implementation of aplace. In Proceedings of the International Symposium on Physical Design (ISPD'06). 218--220. Google ScholarDigital Library
- G. Karypis and V. Kumar. 1999. hMetis2.0. http://glaros.dtc.umn.edu/gkhome/.Google Scholar
- M.-C. Kim and I. Markov. 2012. ComPLx: A competitive primal-dual lagrange optimization for global placement. In Proceedings of the 49th Annual Design Automation Conference (DAC'12). 747--752. Google ScholarDigital Library
- C. Kodama, K. Fujiyoshi, and T. Koga. 2004. A novel encoding method into sequence-pair. In Proceedings of the International Symposium on Circuits and Systems (ISCAS'04). 329--332. Google ScholarDigital Library
- Q. Ma, L. Xiao, Y.-C. Tam, and E. F. Y. Young. 2011. Simultaneous handling of symmetry, common centroid, and general placement constraints. IEEE Trans. Comput.-Aid. Des. 30, 1, 85--95. Google ScholarDigital Library
- H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. 1996. VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans. Comput.-Aid. Des. 15, 12, 1518--1524. Google ScholarDigital Library
- G.-J. Nam. 2006. ISPD 2006 placement contest: Benchmark suite and results. In Proceedings of the International Symposium on Physical Design (ISPD'06). 167--167. Google ScholarDigital Library
- G.-J. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz. 2005. The ISPD 2005 placement contest and benchmarks suite. In Proceedings of the International Symposium on Physical Design (ISPD'05). 216--220. Google ScholarDigital Library
- G.-J. Nam, S. Reda, C. J. Alpert, P. G. Villarrubia, and A. B. Kahng. 2006. A fast hierarchical quadratic placement algorithm. IEEE Trans. Comput.-Aid. Des. 25, 4, 678--691. Google ScholarDigital Library
- M. Pan, N. Viswanathan, and C. Chu. 2005. An efficient and effective detailed placement algorithm. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'05). 48--55. Google ScholarDigital Library
- J. A. Roy, S. N. Adya, D. A. Papa, and I. L. Markov. 2006. Min-cut floorplacement. IEEE Trans. Comput.-Aid. Des. 25, 7, 1313--1326. Google ScholarDigital Library
- J. A. Roy, A. N. Ng, R. Aggarwal, V. Ramachandran, and I. L. Markov. 2009. Solving modern mixed-size placement instances. Integr. 42, 2, 262--275. Google ScholarDigital Library
- K. Sakanushi, Y. Kajitani, and D. P. Mehta. 2003. The quarter-state-sequence floorplan representation. IEEE Trans. Circ. Syst. I Fundam. Theory Appl. 50, 3, 376--386.Google ScholarCross Ref
- P. Spindler and F. M. Johannes. 2006. Fast and robust quadratic placement combined with an exact linear net model. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'06). 179--186. Google ScholarDigital Library
- T. Taghavi, X. Yang, B.-K. Choi, M. Yang, and M. Sarrafzadeh. 2006. Dragon2006: Blockage-aware congestion-controlling mixed-size placer. In Proceedings of the International Symposium on Physical Design (ISPD'06). 209--211. Google ScholarDigital Library
- Y.-C. Tam, E. F. Y. Young, and C. C. N. Chu. 2006. Analog placement with symmetry and other placement constraints. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'06). 349--354. Google ScholarDigital Library
- X. Tang, R. Tian, and M. D. F. Wong. 2006. Minimizing wire length in floorplanning. IEEE Trans. Comput.-Aid. Des. 25, 9, 1744--1753. Google ScholarDigital Library
- N. Viswanathan, M. Pan, and C. Chu. 2007. FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'07). 135--140. Google ScholarDigital Library
- J. Z. Yan and C. Chu. 2010. DeFer: Deferred decision making enabled fixed-outline floorplanning algorithm. IEEE Trans. Comput.-Aid. Des. 43, 3, 367--381. Google ScholarDigital Library
- J. Z. Yan and C. Chu. 2012. Optimal slack-driven block shaping algorithm in fixed-outline floorplanning. In Proceedings of the ACM International Symposium on Physical Design (ISPD'12). 179--186. Google ScholarDigital Library
- J. Z. Yan, C. Chu, and W. K. Mak. 2011. SafeChoice: A novel approach to hypergraph clustering for wirelength-driven placement. IEEE Trans. Comput.-Aid. Des. 30, 7, 1020--1033. Google ScholarDigital Library
- J. Z. Yan, N. Viswanathan, and C. Chu. 2009a. Handling complexities in modern large-scale mixed-size placement. In Proceedings of the 46th Annual Design Automation Conference (DAC'09). 436--441. Google ScholarDigital Library
- J. Z. Yan, N. Viswanathan, and C. Chu. 2009b. MMS placement benchmarks. http://www.public.iastate. edu/zijunyan/.Google Scholar
- E. F. Y. Young, C. C. N. Chu, and M. L. Ho. 2004. Placement constraints in floorplan design. IEEE Trans. VLSI Syst. 12, 7, 735--745. Google ScholarDigital Library
Index Terms
- An Effective Floorplan-Guided Placement Algorithm for Large-Scale Mixed-Size Designs
Recommendations
Handling complexities in modern large-scale mixed-size placement
DAC '09: Proceedings of the 46th Annual Design Automation ConferenceIn this paper, we propose an effective algorithm flow to handle large-scale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the global level. The flow consists of four steps: 1) The objects in the ...
OptiPlace: optimized placement solution for mixed-size designs
AbstractIn this paper, an optimized placement approach has been presented for mixed-size designs. A novel initial placement approach is introduced to achieve routability-aware global placement using new routability-aware cell clustering, cluster ...
Combinatorial techniques for mixed-size placement
While recent literature on circuit layout addresses large-scale standard-cell placement, the authors typically assume that all macros are fixed. Floorplanning techniques are very good at handling macros, but do not scale to hundreds of thousands of ...
Comments