A pre-placement net length estimation technique for mixed-size circuits

International Workshop on System Level Interconnect Prediction, SLIP

Volumn , Issue , 2009, Pages 45-52

  Fathi, Bahareh ^a   Behjat, Laleh ^a   Rakai, Logan M ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Hypergraph clustering; Physical design; Placement; Wire length estimation

Indexed keywords

APRIORI; BEFORE AND AFTER; HYPERGRAPH CLUSTERING; MAIN CHARACTERISTICS; MIXED-SIZE DESIGNS; NET-LENGTH ESTIMATION; PHYSICAL DESIGN; WIRE LENGTH; WIRE LENGTH ESTIMATION;

DESIGN; ELECTRIC POWER SYSTEM INTERCONNECTION; FORECASTING; INFRARED DETECTORS; TECHNICAL PRESENTATIONS; WIRE;

ESTIMATION;

EID: 77950825798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1572471.1572480     Document Type: Conference Paper

References (34)

1. S. Adya, S. Chaturvedi, J. Roy, D. Papa, and I. Markov. Unification of partitioning, floorplanning and placement. In Proc. of ICCAD, pages 550-557, 2004.
2. C. Alpert, A.Kahng, G. J. Nam, S. Reda, and P. Villarrubia. A semi-persistent clustering technique for VLSI circuit placement. In Proc. of ISPD, pages 200-207, 2005.
3. C. Alpert, D. Huang, and A. Kahng. Multilevel circuit partitioning. IEEE Trans. on CAD, 17(8):655-667, 1998.
4. S. Bodapati and F. Najm. Prelayout estimation of individual wire lengths. IEEE Trans. on VLSI, 9(6):943-958, 2001.
5. A. E. Caldwell, A. B. Kahng, S. Mantik, I. L. Markov, and A. Zelikovsky. On wirelength estimations for row-based placement. IEEE Trans. on CAD, 18(9):1265-1278, 1999.
6. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Can recursive bisection produce routable placements? In Proc. of ACM/IEEE DAC, pages 477-482, 2000.
7. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Improved algorithms for hypergraph bi-partitioning. In Proc. of ASPDAC, pages 661-666, 2000.
8. T. F. Chan, J. Cong, M. Romesis, J. R. Shinnerl, K. Sze, and M. Xie. mPL6: Enhanced multilevel mixed-size placement. In Proc. of ISPD, pages 212-214, 2006.
9. P. Christie and D. Stroobandt. The interpretation and application of Rent's rule. IEEE Trans. On VLSI, 8(6):639-648, 2000.
10. J. Cong and S. Lim. Edge separability-based circuit clustering with application to multilevel circuit partitioning. IEEE Trans. on CAD, 23(3):346-357, 2004.
11. W. Donath. Placement and average interconnection lengths of computer logic. IEEE Trans. CAS, 26(4):272-277, 1979.
12. W. Donath. Wire length distribution for placements of computer logic. IBM Journal of RD, 25(3):152-155, 1981.
13. M. Feuer. Connectivity of random logic. IEEE Transactions on Computers, C-31(1), 1982.
14. T. Hamada, C.-K. Cheng, and P. Chau. A wire length estimation technique utilizing neighborhood density equations. In Proc. of ACM/IEEE DAC, pages 57-61, 1992.
15. T. Hamada, C.-K. Cheng, and P. Chau. A wire length estimation technique utilizing neighborhood density equations. IEEE Trans. on CAD, 15(8):912-922, 1996.
16. H. Heineken and W. Maly. Standard cell interconnect length prediction from structural circuit attributes. In Proc. of the IEEE CICC, pages 167-170, 1996.
17. B. Hu and M. Marek-Sadowska. Fine granularity clustering for large scale placement problems. In Proc. of ISPD, pages 67-74, 2003.
18. B. Hu and M. Marek-Sadowska. Wire length prediction based clustering and its application in placement. In Proc. of DAC, pages 800-805, 2003.
19. A. B. Kahng, A. Member, G. Robins, and S. Member. A new class of iterative steiner tree heuristics with good performance. IEEE Trans. on Computer-Aided Design, 11:893-902, 1992.
20. A. B. Kahng and S. Reda. Intrinsic shortest path length: a new, accurate a priori wirelength estimator. In Proc. of ACM/IEEE DAC, Digest of Technical Papers, ICCAD, volume 2005, pages 173-180, 2005.
21. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Application in VLSI domain. IEEE Trans. on VLSI, 7(1):69-79, 1999.
22. B. Landman and R. Russo. On a pin versus block relationship for partitions of logic graphs. IEEE Trans.on Computers, C20(12):1469-1479, 1971.
23. J. Li and L. Behjat. Net cluster: a net-reduction based clustering preprocessing algorithm. In Proc. of ISPD, volume 26, pages 200-205, 2006.
24. Q. Liu, B. Hu, and M. Marek-Sadowska. Wire length prediction in constraint driven placement. In Proc. of SLIP, pages 99-105, 2003.
25. Q. Liu and M. Marek-Sadowska. Pre-layout wire length and congestion estimation. In Proc. of DAC, pages 582-587, 2004.
26. G. Nam. ISPD 2006 placement contest: Benchmark suite and results. In Proc. of ISPD, page 167, 2006.
27. G. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz. The ISPD2005 placement contest and benchmark suite. In Proc. of ISPD, pages 216-219, 2005.
28. M. Pedram and B. Preas. Interconnection length estimation for optimized standard cell layouts. In Proc. of ICCAD, pages 390-393, 1989.
29. T. Taghavi, F. Dabiri, A. Nahapetian, and M. Sarrafzadeh. Tutorial on congestion prediction. In Proc. of SLIP, pages 15-24, 2007.
30. T. Taghavi, X. Yang, and M. Sarrafzadeh. Dragon2005: Large-scale mixed sized placement tool. In ISPD, pages 245-247, 2005.
31. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, 58:267-288, 1996.
32. N. Viswanathan, M. Pan, and C. Chu. Fastplace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. of ASPDAC, 2007.
33. T. Yan, S. Li, Y. Takashima, and H. Murata. A theoretical study on wire length estimation algorithms for placement with opaque blocks. In Proc. of ASP-DAC, pages 268- 273, 2007.
34. T. Yan and H. Murata. Fast wire length estimation by net bundling for block placement. In Proc. of DAC, Digest of Technical Papers, ICCAD, pages 172- 178, 2006.