Samuel Ward
ABSTRACT
This work presents PADE, a new placer with automatic datapath extraction and evaluation. PADE applies novel data learning techniques to train, predict, and evaluate potential datapaths using high-dimensional data such as netlist symmetrical structures, initial placement hints and relative area. Extracted datapaths are mapped to bit-stack structures that are aligned and simultaneously placed with the random logic. Results show at least 7% average total Half-Perimeter Wire Length (HPWL) and 12% Steiner Wire Length (StWL) improvements on industrial hybrid benchmarks and at least 2% average total HPWL and 3% StWL improvements on ISPD 2005 contest benchmarks. To the best of our knowledge, this is the first attempt to link data learning, datapath extraction with evaluation, and placement and has the tremendous potential for pushing placement state-of-the-art for modern circuits which have datapath and random logics.
- M.-C. Kim, D.-J. Lee, and I. L. Markov, "simPL: an effective placement algorithm," in Proc. ICCAD, pp. 649--656, 2010. Google Scholar
Digital Library
- G.-J. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz., "ISPD 2005 placement contest benchmark suite," in Proc. ISPD, pp. 216--220, 2005. Google ScholarDigital Library
- G.-J. Nam and J. Cong, eds., Modern Circuit Placement: Best Practices and Results. New York, NY: Springer, 2007. Google ScholarDigital Library
- R. X. T. Nijssen and J. A. G. Jess, "Two-dimensional datapath regularity extraction," in IFIP Workshop on Logic and Architecture Synthesis, pp. 110--117, 1996.Google Scholar
- S. I. Ward, D. A. Papa, Z. Li, C. N. Sze, C. J. Alpert, and E. Swartzlander, "Quantifying academic placer performance on custom designs," in Proc. ISPD, pp. 91--98, 2011. Google ScholarDigital Library
- S. I. Ward, M.-C. Kim, N. Viswanathan, Z. Li, C. Alpert, E. Swartzlander, and D. Z. Pan, "Keep it straight: Teaching placement how to better handle designs with datapaths," in Proc. ISPD, 2012. Google ScholarDigital Library
- N. Viswanathan, M. Pan, and C. Chu, "FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control," in Proceedings of ASPDAC, pp. 135--140, 2007. Google ScholarDigital Library
- A. Chowdhary, S. Kale, P. Saripella, N. Sehgal, and R. Gupta, "Extraction of functional regularity in datapath circuits," IEEE TCAD, vol. 18, no. 9, pp. 1279--1296, 1999. Google ScholarDigital Library
- A. Rosiello, F. Ferrandi, D. Pandini, and D. Sciuto, "A hash-based approach for functional regularity extraction during logic synthesis," in Proc. ISVLSI, pp. 92--97, 2007. Google ScholarDigital Library
- S. Ono and P. H. Madden, "On structure and suboptimality in placement," in Proceedings of ASPDAC, pp. 331--336, 2005. Google ScholarDigital Library
- P. Ienne and A. GrieBing, "Practical experiences with standard-cell based datapath design tools," in Proceedings of DAC, pp. 396--401, 1998. Google ScholarDigital Library
- P. Spindler, U. Schlichtmann, and F. M. Johannes, "Kraftwerk2 - a fast force-directed quadratic placement approach using an accurate net model," IEEE TCAD, vol. 27, no. 8, pp. 1398--1411, 2008. Google ScholarDigital Library
- Q. Liu and M. Marek-Sadowska, "Pre-layout physical connectivity predictions with applications in clustering, placement and logic synthesis," in Proc. ICCAD, pp. 31--37, 2005. Google ScholarDigital Library
- T. Junttila and P. Kaski, "Engineering an efficient canonical labeling tool for large and sparse graphs," 2007.Google Scholar
- R.-E. Fan, P.-H. Chen, and C.-J. Lin, "Working Set Selection Using Second Order Information for Training Support Vector Machines," in Journal of Machine Learning Research, 2005. Google ScholarDigital Library
- J. E. Beasley, ed., Advances in Linear and Integer Programming. New York, NY: Oxford University Press, Inc., 1996. Google ScholarDigital Library
- H. Shojaei, A. Davoodi, and J. Linderoth, "Congestion analysis for global routing via integer programming," in Proc. ICCAD, pp. 256--262, 2011. Google ScholarDigital Library
- G. Optimization, "The gurobi optimizer 4.5." http://www.gurobi.com/.Google Scholar
- J. A. Roy, D. A. Papa, S. N. Adya, H. H. Chan, A. N. Ng, J. F. Lu, and I. L. Markov, "Capo: robust and scalable open-source min-cut floorplacer," in Proc. ISPD, pp. 224--226, 2005. Google ScholarDigital Library
- T. F. Chan, J. Cong, J. R. Shinnerl, K. Sze, and M. Xie, "mPL6: enhanced multilevel mixed-size placement," in Proc. ISPD, pp. 212--214, 2006. Google ScholarDigital Library
- T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang, "A high-quality mixed-size analytical placer considering preplaced blocks and density constraints," in Proc. ICCAD, pp. 187--192, 2006. Google ScholarDigital Library
- T. Kutzschebauch and L. Stok, "Regularity driven logic synthesis," in Proc. ICCAD, pp. 439--446, 2000. Google ScholarDigital Library
Index Terms
- PADE: a high-performance <u>p</u>lacer with <u>a</u>utomatic <u>d</u>atapath <u>e</u>xtraction and evaluation through high dimensional data learning
Recommendations
Keep it straight: teaching placement how to better handle designs with datapaths
ISPD '12: Proceedings of the 2012 ACM international symposium on International Symposium on Physical DesignAs technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell components. This work begins by demonstrating that conventional Half-...
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 ...
Graph-Based Logic Bit Slicing for Datapath-Aware Placement
DAC '17: Proceedings of the 54th Annual Design Automation Conference 2017Extracting similar datapath bit slices which handle highly parallel bit operations can help a modern placer to obtain better solutions for datapath-oriented designs. A current state-of-the-art datapath bit slicing method achieves the best extraction ...
Comments