An Improved Two-Way Partitioning Algorithm with Stable Performance

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

Volumn 10, Issue 12, 1991, Pages 1502-1511

  Cheng, Chung Kuan ^a   Wei, Yen Chuen A ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRATED CIRCUITS, VLSI--COMPUTER AIDED DESIGN; MATHEMATICAL TECHNIQUES--ALGORITHMS;

KERNIGHAN-LIN-BASED ALGORITHMS; PARTITIONING ALGORITHMS;

INTEGRATED CIRCUITS, VLSI;

EID: 0026396076     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.103500     Document Type: Article

References (21)

1. J. Blanks, “Partitioning by probability condensation,” in Proc. ACM/IEEE 26th Design Automat. Conf., 1989, pp. 758-761.
2. B. Bollobas, Random Graphs. New York: Academic Press, 1985, pp. 31-53.
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 26th Design Automat. Conf., 1989, pp. 775-778.
4. M. Burstein, “Analysis of a network partitioning technique,” in IEEE Int. Symp. Circuits Syst. Dig., vol. 2, 1982, pp. 477-480.
5. W. E. Donath, “Logic partitioning,” in Physical Design Automation of VLSI Systems, B. Preas and M. Lorenzetti, Eds. Menlo Park, CA: Benjamin-Cummings, 1988, pp. 65-86.
6. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
7. C. M. Fiduccia and R. M. Mattheyses “A linear time heuristic for improving network partitions,” in Proc. ACM/IEEE 19th Design Automat. Conf., 1982, pp. 175-181.
8. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some Simplified NP-Complete Graph Problems, Theoretical Computer Science, 1976, pp. 237-267.
9. M. Khellaf, “On the partitioning of graphs and hypergraphs,” Ph.D. dissertation, Indus. Engineering and Operations Research, Univ. of California, Berkeley, 1987.
10. B. Krishnamurthy, “An improved min-cut algorithm for partitioning VLSI networks,” IEEE Trans. Comput., vol. C-33, pp. 438-446, May 1984.
11. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, no. 2, pp. 291-307, Feb. 1970.
12. T. Leighton and S. Rao, “An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms,” in Dig. IEEE Symp. Foundations of Computer Science, 1988, pp. 422-431.
13. D. W. Matula and F. Shahrokhi, “The maximum concurrent flow problem and sparsest cuts,” Tech. Rep., Southern Methodist Univ., 1986.
14. T. Ng, J. Oldfield, and V. Pitchumani, “Improvements of a mincut partition algorithm,” in Proc. IEEE lnt. Conf. Computer-Aided Design, 1987, pp. 470-473.
15. C. H. Papadimitriou, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
16. L. A. Sanchis, “Multi-way network partitioning,” IEEE Trans. Comput., vol. 38, pp. 62-81, Jan. 1989.
17. C. Sechen and D. Chen, “An improved objective function for mincut circuit partitioning,” in Proc. IEEE Int. Conf Computer-Aided Design, 1988, pp. 502-505.
18. D. G. Schweikert and B. W. Kemighan, “A proper model for the partitioning of electrical circuits,” in Proc. 9th Design Automat. Workshop, 1972, pp. 57-62.
19. Y. Saab and V. Rao, “An evolution-based approach to partitioning ASIC systems,” in Proc. ACM/IEEE 26th Design Automat. Conf., 1989, pp. 767-770.
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.
21. Y.-C. Wei and C.-K. Cheng, “Ratio cut partitioning for hierarchical designs,” Tech. Rep. CS90-164, Univ. California, San Diego, Jan. 1990.