An evaluation of bipartitioning techniques

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

Volumn 16, Issue 8, 1997, Pages 849-866

  Hauck, Scott ^a   Borriello, Gaetano ^b  

^a Northwestern University   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; VLSI CIRCUITS;

LOGIC BIPARTITIONING;

COMPUTER AIDED LOGIC DESIGN;

EID: 0031198780     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.644609     Document Type: Article

References (28)

1. C. J. Alpert and A. B. Kahng, "Recent directions in netlist partitioning: A survey," Integration: VLSI J., vol. 19, no. 1-2, pp. 1-81, 1995.
2. C. J. Alpert and S.-Z. Yao, "Spectral partitioning: The more eigenvectors, the better," in Proc. Design Automation Conf., 1995, pp. 195-200.
3. C. Alpert, http://ballade.cs.ucla.edu:8080/cheese/benchmarks.html, 1996.
4. T. Bui, C. Heigham, C. Jones, and T. Leighton, "Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms," in Proc. Design Automation Conf., 1989, pp. 775-778.
5. C. K. Cheng and T. C. Hu, "Maximum concurrent flow and minimum ratio-cut," Tech. Rep. CS88-141, Univ. California, San Diego, Dec. 1988.
6. J. Cong and M. Smith, "A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design," in Proc. Design Automation Conf., 1993, pp. 755-760.
7. 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.
8. C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improved network partitions," in Proc. Design Automation Conf., 1982, pp. 241-247.
9. Z. Galil, "Efficient algorithms for finding maximum matching in graphs," ACM Computing Surveys, vol. 18, pp. 23-38, Mar. 1986.
10. J. Garbers, H. J. Prömel, and A. Steger, "Finding clusters in VLSI circuits," in Proc. Int. Conf. Computer-Aided Design, 1990, pp. 520-523.
11. M. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
12. M. K. Goldberg and M. Burstein, "Heuristic improvement technique for bisection of VLSI networks," in Proc. Int. Conf. Comput. Design, 1983, pp. 122-125.
13. L. Hagen and A. B. Kahng, "New spectral methods for ratio cut partitioning and clustering," IEEE Trans. Computer-Aided Design, vol. 11, pp. 1074-1085, Sept. 1992.
14. L. Hagen, J. H. Huang, and A. B. Kahng, "On implementation choices for iterative improvement partitioning algorithms," in Proc. European Design Automation Conf., 1995, pp. 144-149.
15. S. Hauck and G. Borriello, "Logic partition orderings for Multi-FPGA systems," in Proc. Int. Symp. Field-Programmable Gate Arrays, 1995, pp. 32-38.
16. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning of electrical circuits," Bell Syst. Tech. J., vol. 49, pp. 291-307, Feb. 1970.
17. B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks," IEEE Trans. Comput., vol. C-33, pp. 438-446, May 1984.
18. MCNC Partitioning93 benchmark suite, e-mail: benchmarks@mcnc.org, for ftp access.
19. B. M. Riess, K. Doll, and F. M. Johannes, "Partitioning very large circuits using analytical placement techniques," in Proc. Design Automation Conf., 1994, pp. 646-651.
20. K. Roy and C. Sechen, "A timing driven ra-way chip and multichip partitioner," in Proc. Int. Conf. Computer-Aided Design, 1993, pp. 240-247.
21. D. M. Schuler and E. G. Ulrich, "Clustering and linear placement," in Proc. Design Automation Conf., 1972, pp. 50-56.
22. 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.
23. U. Weinmann, "FPGA partitioning under timing constraints," in More FPGAs, W. R. Moore and W. Luk, Eds. Oxford: Abingdon EE&CS Books, 1984, pp. 120-128.
24. Xilinx, Inc., The Programmable Gate Array Data Book, 1992.
25. H. Yang and D. F. Wong, "Efficient network flow based min-cut balanced partitioning," in Proc. Int. Conf. Comput.-Aided Design, 1994, pp. 50-55.
26. C.-W. Yeh, C.-K. Cheng, and T.-T. Y. Lin, "A general purpose multiple way partitioning algorithm," in Proc. Design Automation Conf., 1991, pp. 421-426.
27. _, "A probabilistic multicommodity-flow solution to circuit clustering problems," in Proc. Int. Conf. Comput.-Aided Design, 1992, pp. 428-431.
28. _, "Optimization by iterative improvement: An experimental evaluation on two-way partitioning," IEEE Trans. Computer-Aided Design, vol. 14, pp. 145-153, Feb. 1995.