Net cluster: A net-reduction based clustering preprocessing algorithm

Proceedings of the International Symposium on Physical Design

Volumn 2006, Issue , 2006, Pages 200-205

  Li, Jianhua ^a   Behjat, Laleh ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Hypergraph Clustering; Physical Design; VLSI Partitioning

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; DIGITAL CIRCUITS; INTEGRATED CIRCUIT LAYOUT; STANDARDS;

HYPERGRAPH CLUSTERING; PHYSICAL DESIGN; VLSI PARTITIONING;

ALGORITHMS;

EID: 33745963939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A. Agnihotri, S. Ono, and P. Madden. Recursive bisection placement: Feng shui 5.0 implementation details. In Proc. ISPD, pages 230-232, 2005.
2. C. Alpert, A. Kahng, G.-.J. Nam, S. Reda, and P. Villarrubia. A semi-persistent clustering technique for vlsi circuit placement. In Proc. ISPD, pages 200-207, 2005.
3. C. J. Alpert, The ISPD98 circuit benchmark suite. In Proc. ISPD, pages 80-85, 1998.
4. C. J. Alpert, D. Huang, and A. B. kahng. Multilevel circuit partitioning. IEEE Trans. on CAD, 17(8):655-667, 1998.
5. L. Behjat, D. Kucar, and A. Vannelli. A novel eigenvector technique fot large scale combinatorial problems in vlsi layout. Journal of Combmatorial Optimization, 2002.
6. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Improved algorithms for hypergraph bi-partitioning. In Proc. Asia and South Pacific DAC, pages 661-666, 2000.
7. T. Chan, J. Cong, and K. Sze. Multilevel generalized force-directed method for circuit placement. In Proc. ISPD, pages 185-192, 2005.
8. T. Chen, T. Hsu, Z. Jian, and Y. Chang, Ntuplace: A ratio partitioning based placement algorithm for large-scale mixed-sized designs. In Proc. ISPD, pages 236-238, 2005.
9. 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.
10. C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In Proc. DAC, pages 175-181, 1982.
11. B. Hu and M. Marek-Sadowska. Fine granularity clustering for large scale placement problems. In Proc. ISPD, pages 67-74, 2003.
12. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Application in vlsi design. In Proc. DAC, pages 526-529, 1997.
13. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Application in VLSI domain. IEEE Trans. on VLSI Systems, 7(1):69-79, 1999.
14. G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. In Proc. DAC, pages 343-348, 1999.
15. J. Li and L. Behjat. A connectivity based clustering algorithm with applications to vlsi circuit partitioning. IEEE Trans. on CAS II, 10.1109/TCSTI.2005.862174:5, 2006.
16. X. Y. M. Wang and M. Sarrafzadeh. Dragon2000: Standard-cell placement tool for large industry circuits. In Proc. ICCAD, pages 260-263, 2000.
17. G. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz. The ISPD2005 placement contest and benchmark suite. In Proc. ISPD, pages 216-219, 2005.
18. J. Roy, D. Papa, S. Adya, H. Chan, A. Ng, F. Lu, and I. Markov. Capo: Robust and scalable open-source min-cut floorplacer. In Proc. DAC, pages 477-482, 2000.
19. Y. Saab. An effective multilevel algorithm for bisecting graphs and hypergraphs. IEEE Trans. on Computers, 53 (6): 641-652, 2004.
20. K. Vorwerk, A. Keimlings, and A. Vannelli. Engineering details of a stable force-directed placer. In Proc. ICCAD, pages 573-580, 2004.
21. S. Wichlnnd and E. Aas. On multilevel circuit partitioning. In Proc. ICCAD, pages 505-511, 1998.