Wire length prediction based clustering and its application in placement

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 800-805

  Hu, Bo ^a   Marek Sadowska, Malgorzata ^a  

^a University of California   (United States)

Author keywords

Clustering; Placement; Wire length prediction

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER AIDED ENGINEERING; INTERCONNECTION NETWORKS;

CLUSTERING ALGORITHMS;

VLSI CIRCUITS;

EID: 0042635590     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775832.776035     Document Type: Conference Paper

References (19)

1. S. Bodapati and F.N. Najm, "Pre-Layout Estimation of Individual Wire lengths", ACM Intl. Workshop on System-Level Interconnect Prediction, pp. 93-98, April 2000.
2. A.E. Caldwell, A.B. Kahng, S. Mantik, I.L. Markov and A. Zelikovsky, "On wire length estimations for row-based placement", IEEE Trans. on Computer-Aided Design, pp. 1265-1278, Sep 1999.
3. A. E. Caldwell, A. B. Kahng, I. L. Markov, "Can recursive bisection alone produce routable placements", Design Automation Conference, 2000, pp. 260-263
4. J. Cong and S. K. Lim, "Edge separability based circuit clustering with application to circuit partitioning", Proc. ASP-DAC, 2000, pp. 429-434.
5. H.Eisenmann and F.M.Johannes, "Generic Global Placement and Floor planning", in Proc. of the 35th Design Automation Conference, pp. 269-274, 1998.
6. J. Garbers, H. J. Promel, and A. Steger, "Finding clusters in VLSI circuits, ", In Proc. Int. Conf. Computer-Aided Design, 1990, pp. 520-523.
7. T. Hamada, C.K. Cheng and P.M. Chau, "A wire length estimation technique utilizing neighborhood density equations", IEEE Trans. on Computer-Aided Design, vol. 15. pp. 912-922, August 1996.
8. S. Hauck and G. Borriello, "An evaluation of bipartitioning techniques", IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol 16, No. 8, 1997.
9. H.T. Heineken and W. Maly, "Standard Cell Interconnect Length Predication from Structural Circuit Attributes", Proc. Custom Integrated Circuits Conference, pp. 167-170, 1996.
10. B. Hu, M. Marek-Sadowska, "Fine-granularity clustering for large-scale placement problems", Proc. Intl. Symp. on Physical Design, 2003.
11. D.J. Huang and A.B. Kahng, "When clusters meet partitions: new density-based methods for circuit decomposition", Proc. DATE, pp. 60-64, 1995.
12. M. Pedram and B.T. Preas, "Interconnection Length Estimation for Optimized Standard Cell Layouts", Proc. ICCAD, pp. 390-393, 1989.
13. K. Roy and C. Sechen, "A timing driven n-way chip and multi-chip partitioner,", In Proc. Int. Conf. Computer-Aided Design, 1993, pp 240-247.
14. D.M. Schuler and E. G. Ulrich, "Clustering and linear placement", Proc. DAC, 1972.
15. W. Sun and C. Sechen, "Efficient and Effective Placement for Very Large Circuits", Proc. IEEE ICCAD, 1993, pp. 170-177.
16. M. Wang, X. Yang and M. Sarrafzadeh, "Dragon2000: Standard-cell Placement Tool for Large Industry Circuits,", Proc. ICCAD, pp. 260-264, 2000.
17. Y.C. Wei and C.K. Cheng, "Ratio cut partitioning for hierarchical designs", IEEE Trans. on Computer-Aided Design, pp. 911-921, 1992.
18. IBM-place benchmarks: http://gigascale.org/bookshelf/.
19. Latest Capo (version 8.5): http://vlsicad.ucsd.edu/Resources/ Software Links/PDtools/