ENISLE: An intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning

ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

Volumn 5, Issue , 2001, Pages 167-170

  Cheng, Shun Wen ^a   Cheng, Kuo Hsing ^a  

^a TAMKANG UNIVERSITY   (Taiwan)

Author keywords

clustering effect; EDA; IC CAD; iterative improvement; min cut partitioning; radix sort; ratio min cut partitioning; System on a Chip (SoC); VLSI circuit

Indexed keywords

ITERATIVE METHODS; OPTIMAL SYSTEMS; PROGRAMMABLE LOGIC CONTROLLERS; SYSTEM-ON-CHIP; VLSI CIRCUITS; ALGORITHMS; HEURISTIC METHODS;

CLUSTERING EFFECT; ITERATIVE IMPROVEMENTS; MIN-CUT; RADIX SORT; SYSTEM ON A CHIP;

OPTIMIZATION; VLSI CIRCUITS;

MINCUT PARTITIONING;

EID: 0035014386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iscas.2001.922011     Document Type: Conference Paper

References (20)

1. S. B. Akers, "Clustering Techniques for VLSI." in Proc. IEEE Int. Symp. on Circuits and Systems. 1982, pp. 472-476.
2. C. J. Alpert, J.-H. Huang, and A. B. Kahng, "Multilevel circuit partitioning, " in Proc. Design Automation Conf. 1997, pp. 530-533.
3. C. J. Alpert and S.-Z. Yao. "Spectral partitioning: The more eigenvectors the better, " in Proc. IEEE/ACM Design Automation Conf. 1995, pp. 195-200.
4. J. Cong et al. "Large scale circuit partitioning with loose/stable net removal and signal flow based clustering, " in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, Nov. 1997, pp. 441-446.
5. J. Cong and S. K. Lim. "Multiway Partitioning with Pairwise Movement." in Proc. IEEE/ACM Int. Conf. Computer-Aided Design. 1998. pp. 512-516.
6. S. Dutt and W. Deng. "A probability-based approach to VLSI circuit partitioning." in Proc. IEEE/ACM Design Automation Conf. June 1996. Best-Paper Award, pp. 100-105.
7. S. Dutt. "New faster Kernighan-Lin-type graph-partitioning algorithms." in Proc. IEEE/ACM Int. Conf. Computer-Aided Design. Nov. 1993.
8. C. M. Fiduccia and R. M. Mattheyses. "A linear-time heuristic for improving network partitions." in Proc. IEEE/ACM 19th Design Automation Conf. 1982. pp. 175-181.
9. J. Garbers, H. J. Promel. and A. Steger. "Finding clusters in VLSI circuits." in Proc. IEEE/ACM Int. Conf. Computer-Aided Design. 1990. pp. 520-523.
10. M. R. Garey and D. S. Johnson. Computers and Intractability. San Francisco. CA: W. H. Freeman, pp. 209-210.
11. L. Hagen and A. Kahng. "Fast spectral methods for ratio cut partitioning and clustering." in Proc. IEEE/ACM Int. Conf. Computer-Aided Design. 1991, pp. 10-13.
12. M. A. B. Jackson, A. Srinivasan and E. S. Kuh. "A fast algorithm for performance driven placement." in Proc. IEEE/ACM Int. Conf. Compuler-Aided Design. 1990. pp. 328-331.
13. B. W. Kernighan and S. Lin. "An efficient heuristic procedure for partitioning graphs." Bell System Tech. Journal, vol. 49, pp. 291-307. Feb. 1970.
14. D. E. Knuth. Sorting and Searching. Addison-Wesley, 1973.
15. B. Krishnamurthy, "An improved nun-cut algorithm for partitioning VLSI networks." IEEE Trans. Computers, vol. C-33. pp. 438-446. May 1984.
16. Y. G. Saab. "A fast and robust network bisection algorithm." IEEE Trans. Computers, pp. 903-913. 1995.
17. C. Sechen. VLSI Placement and Global Routing Using Simulated Annealing. B. V. Deventer. Ed. Amsterdam. Netherlands: Kluwer.
18. N. A. Sherwani. Algorithms for VLSI Physical Design Automation. 3rd Ed. Boston. MA: Kluwer. 1999.
19. Y. C. Wei and C. K. Cheng, "An improved two-way partitioning algorithm with stable performance, " IEEE Trans. Computer-Aided Design, pp. 1502-1511. 1990.
20. Y. C. Wei and C. K. Cheng. 'Toward efficient hierarchical designs by ratio cut partitioning." in Proc. Int. Conf. Computer-Aided Design. 1989. pp. 298-301.