On implementation choices for iterative improvement partitioning algorithms

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 16, Issue 10, 1997, Pages 1199-1205

  Hagen, Lars W ^a   Huang, Dennis J H ^a   Kahng, Andrew B ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

gain bucket implementation; hypergraph partitioning; iterative movement; kernighan lin algorithm; Mattheyses algorithm; multiway partitioning; vlsi netlist partitioning

Indexed keywords

EID: 0012051942     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.662682     Document Type: Article

References (20)

1. C. J. Alpert and A. B. Kahng, "Geometric embeddings for faster and better multi-way netlist partitioning," in Proc. ACM/IEEE Design Automation Conf.. 1993, pp. 743-748.
2. _, "A general framework for vertex orderings, with applications to netlist clustering," in Proc. IEEE Int. Conf. Computer-Aided Design, 1994, pp. 63-67.
3. T. Bui, C. Heigham, C. Jones, and T. Leighton, "Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms," in Proc. ACM/IEEE Design Automation Conf., 1989, pp. 775-778.
4. P. K. Chan, M. D. F. Schlag, and J. Y. Zien, "Spectral A'-way ratio-cut partitioning and clustering," IEEE Trans. Computer-Aided Design, vol. 13, pp. 1088-1096, Sept. 1994.
5. C.-K. Cheng and Y.-C. A. Wei, "An improved two-way partitioning algorithm with stable performance," IEEE Trans. Computer-Aided Design, vol. 10, pp. 1502-1511, 1991.
6. A. Dasdan and C. Aykanat, "Improved multiple-way circuit partitioning algorithms," in Proc. ACM/SIGDA Int. Workshop Field-Programmable Gate Arrays, 1994.
7. S. Dutt, "New faster Kernighan-Lin-type graph-partitioning algorithms," in Proc. IEEE Int. Conf. Computer-Aided Design, 1993, pp. 370-377.
8. C. M. Fiduccia and R. M. Mattheyses, "A linear time heuristic for improving network partitions," in Proc. ACM/IEEE Design Automation Conf., 1982, pp. 175-181.
9. L. Hagen and A. B. Kahng, "A new approach to effective circuit clustering," in Proc. IEEE Int. Conf. Computer-Aided Design, 1992, pp. 422-27.
10. A. G. Huffman, "The dynamic locking heuristic-A new graph partitioning algorithm," in Proc. IEEE Int. Symp. Circuits Systems, 1994, pp. 173-176.
11. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Tech. ]., vol. 49, no. 2, pp. 291-307, 1970.
12. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
13. B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks," IEEE Trans. Comput., vol. 33, pp. 438-146, 1984.
14. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. New York: Wiley-Teubner, 1990.
15. Y. Saab, "A fast and robust network bisection algorithm," IEEE Trans. Comput., vol. 44, 1995.
16. L. A. Sanchis, "Multiple-way network partitioning," IEEE Trans. Cornput., vol. 38, pp. 62-81, 1989.
17. _, private communication, Mar. 1994.
18. D. G. Schweikert and B. W. Kernighan, "A proper model for the partitioning of electrical circuits," in Proc. ACM/IEEE Design Automation Conf., 1972, pp. 57-62.
19. C. Sechen, "Placement and global routing of integrated circuits using simulated annealing," Ph.D. dissertation, Univ. California, Berkeley, 1986.
20. Y.-C. Wei and C.-K. Cheng, "Toward efficient hierarchical designs by ratio cut partitioning," in Proc. IEEE Int. Conf. Computer-Aided Design, 1989, pp. 298-301.