Multilevel spectral hypergraph partitioning with arbitrary vertex sizes

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

Volumn 18, Issue 9, 1999, Pages 1389-1399

  Zien, J Y ^a   Schlag, M D F ^a   Chan, P K ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK SYNTHESIS; ITERATIVE METHODS; LAPLACE TRANSFORMS;

ARBITRARY VERTEX SIZES; MULTILEVEL BOTTOM-UP CLUSTERING ALGORITHMS; MULTILEVEL SPECTRAL HYPERGRAPH PARTITIONING;

INTEGRATED CIRCUIT LAYOUT;

EID: 0032595820     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.784130     Document Type: Article

References (35)

1. T. Leighton and S. Rao, "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximate algorithms," presented at FOCS'29, 1988.
2. Y.-C. Wei and C.-K. Cheng, "Toward efficient hierarchical designs by ratio cut partitioning," in Proc. IEEE Int. Conf. Computer-Aided Design, 19, pp. 298-301.
3. Y.-C. Wei, C.-K. Cheng, and Z. Wurman, "Multiple-level partitioning: An application to the very large-scale hardware simulator," IEEE J. Solid-State Circuits, vol. 26, pp. 706-716, May 1991.
4. B. Hendrickson and R. Leland, "An improved spectral graph partitioning algorithm for mapping parallel computations," SIAM J. Scientific Computing, vol. 16, no. 2, pp. 452-4169, 1995.
5. S. T. Barnard and H. D. Simon, "A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems," NASA Ames Research Center, NAS Syst. Div., Moffet Field, CA, Tech. Rep. RNR92-033, Nov. 1992.
6. B. Hendrickson and R. Leland, "A multilevel algorithm for partitioning graphs," Sandia Nat. Labs., Albuquerque, NM, Tech. Rep. SAND931301HJC405, 1993.
7. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel hypergraph partitioning: Application in VLSI domain," in Proc. ACM IEEE 34th Design Automation Conf., June 1997, pp. 526-529.
8. "Multilevel hypergraph partitioning: Applications in VLSI domain," Dept. of Comput. Sci., Univ. Minnesota, Minneapolis, MN, Tech. Rep., 1998; [OnlineJ. Available: www-users.cs.umn.edurkarypis/publications/partitioning.html.
9. C. Alpert, J.-H. Huang, and A. Kahng, "Multilevel circuit partitioning," IEEE Trans. Computer-Aided Design, Aug. 1998, vol. CAD17, pp. 655-667.
10. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Tech. J., vol. 49, pp. 291-307, Feb. 1970.
11. C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions," in Proc. 19th Design Automation Conf., ACM, 1982, pp. 175-181.
12. B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks," IEEE Trans. Comput., vol. C33, pp. 438-4146, May 1984.
13. L. A. Sanchis, "Multiple-way network partitioning," IEEE Trans. Cornput., vol. 38, pp. 62-74, Jan. 1989.
14. S. Dutt and W. Deng, "VLSI circuit partitioning by cluster-removal using iterative improvement techniques," in Proc. IEEE ICCAD, 19, pp. 194-200.
15. D. S. Johnson, C. A. Aragon, L. A. McGeoch, and C. Schevon, "Optimization by simulated annealing: An experimental evaluation-Pt. 1," Operations Res., vol. 37, pp. 865-892, Nov./Dec. 1989.
16. T. Bui and B.-R. Moon, "GRCA: A hybrid genetic algorithm for circuit ratio-cut partitioning," IEEE Trans. Computer-Aided Design, vol. 17, pp. 193-204, Mar. 1998.
17. E. Barnes, "An algorithm for partitioning the nodes of a graph," SIAM J. Algorithm Discrete Meth., vol. 3, pp. 541-550, Dec. 1982.
18. W. Donath and A. Huffman, "Lower bounds for the partitioning of graphs," IBM J. Res. Develop., vol. 17, pp. 420-425, Sept. 1973.
19. S. W. Hadley, B. L. Mark, and A. Vannelli, "An efficient eigenvector approach for finding netlist partitions," IEEE Trans. Computer-Aided Design, vol. 11, pp. 885-892, July 1992.
20. J. Frankle and R. M. Karp, "Circuit placements and cost bounds by eigenvector decomposition," in Proc. IEEE Int. Conf. Computer-Aided Design ICCAD'86, Santa Clara, CA, Nov. 1986, pp. 414-417.
21. R. Boppana, "Eigenvalues and graph bisection: An average-case analysis," in Proc. IEEE Symp. Foundations of Computer Science, 19, pp. 280-285.
22. F. Rendl and H. Wolkowicz, "A projection technique for partitioning the nodes of a graph," Univ. Waterloo, Waterloo, Ont., Canada, Tech. Rep., Apr. 1991.
23. K. M. Hall, "An r-dimensional quadratic placement algorithm," Management Sci., vol. 17, pp. 219-229, Nov. 1970.
24. A. Pothen, H. D. Simon, and K.-P. Lious, "Partitioning sparse matrices with eigenvectors of graphs," SIAM J. Matrix Anal. Applicat., vol. 11, pp. 430-452, July 1990.
25. L. Hagen and A. Kahng, "New spectral methods for ratio cut partitioning and clustering," IEEE Trans. Computer-Aided Design, vol. CAD11, pp. 1074-1085, Sept. 1992.
26. P. K. Chan, M. D. F. Schlag, and J. Y. Zien, "Spectral fCway ratio-cut partitioning and clustering," IEEE Trans. Computer-Aided Design, vol. 13, pp. 1088-1096, Sept. 1994.
27. C. J. Alpert and A. B. Kahng, "Multiway partitioning via geometric embeddings, orderings, and dynamic programming," IEEE Trans. Computer-Aided Design, vol. 14, pp. 1342-1358, Nov. 1995.
28. C. J. Alpert and S.-Z. Yao, "Spectral partitioning: The more eigenvectors, the better," in Proc. 32nd ACM/IEEE Design Automation Conf., June 1995, pp. 195-200.
29. E. R. Barnes, "Partitioning the nodes of a graph," in Proc. Graph Theory with Applications to Algorithms and Computer Science, 19, pp. 57-72.
30. J. Li, J. Lillis, L.-T. Liu, and C.-K. Cheng, "New spectral linear placement and clustering approach," in Proc. ACM IEEE 33rd Design Automation Conf., June 1996, pp. 88-93.
31. Y.-C. Wei and C.-K. Cheng, "A two-level two-way partitioning algorithm," in Proc. IEEE ICCAD, 19, pp. 516-519.
32. K. M. Hall, "An r-dimensional quadratic placement algorithm," Management Sci., vol. 17, pp. 219-229, Nov. 1970.
33. K. Fan, "On a theorem of Weyl concerning eigenvalues of linear transformations-Part I," in Proc. Int. National Academy of Sciences, 19, vol. 35, pp. 652-655.
34. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," Dept. of Comput. Sci., Univ. Minnesota, Minneapolis, MN, Tech. Rep. 95-035, July 1995.
35. J. A. Frankle, "Circuit placement methods using multiple eigenvectors and linear probe techniques," Electron. Res. Lab., Univ. California, Berkeley, CA, Tech. Rep. UCB/ERL M87β2, May 1987.