Hypergraph partitioning and clustering

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 61-1-61-20

  Papa, David A ^a   Markov, Igor L ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85056031799     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (59)

1. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NPCompleteness, Freeman, San Francisco, CA, 1979.
2. Kernighan, B. W. and Lin, S., An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J., 49, 291, 1970.
3. Fiduccia, C. M. and Mattheyses, R. M., A linear-time heuristic for improving network partitions, Proc. DAC, 1982, p. 175.
4. Bui, T., Chaudhuri, S., Leighton, F. T., and Sipser, M., Graph bisection algorithms with good average behavior, Combinatorica, 7(2), 172, 1987.
5. Krishnamurthy, B., An improved min-cut algorithm for partitioning VLSI networks, IEEE Trans. Comp., C-33, 438, 1984.
6. Sanchis, L., Multiple-way network partitioning with different cost functions, IEEE Trans. Comp., 42(12), 1500, 1993.
7. Hagen, L.W., Huang, D. J., and Kahng, A. B., On implementation choices for iterative improvement partitioning methods, Proc. Eur. Design Automation Conf., 1995, p. 144.
8. Liu, L. T., Kuo, M. T., Huang, S. C., and Cheng, C. K., A gradient method on the initial partition of Fiduccia–Mattheyses algorithm, Proc. ICCAD, 1995, p. 229.
9. Dutt, S. and Deng W., VLSI circuit partitioning by cluster-removal using iterative improvement techniques, Proc. ICCAD, 1996, p. 194.
10. Alpert, C. J., Huang, J.-H., and Kahng, A. B., Multilevel circuit partitioning, Proc. DAC, 1997, p. 530.
11. Cong, J., Li, H. P., Lim, S. K., Shibuya, T., and Xu, D., Large scale circuit partitioning with loose stable net removal and signal flow based clustering, Proc. ICCAD, 1997, p. 441.
12. Hauck, S. and Borriello, G., An evaluation of bipartitioning techniques, IEEE Trans. CAD, 16(8), 849, 1997.
13. Karypis, G., Aggarwal, R., Kumar, V., andShekhar, S., Multilevelhypergraphpartitioning: applications in VLSI design, Proc. DAC, 1997, p. 526.
14. Dutt, S. and Theny, H., Partitioning using second-order information and stochastic gain function, Proc. ISPD, 1998, p. 112.
15. Im, E. J. and Yelick, K. A., Optimizing sparse matrix vector multiplication on SMP, Proc. PPSC, 1999.
16. Ogielski, A. T. and Aiello, W., Sparse matrix computations on parallel processor arrays, SIAM J. Scientific Comput., 14(3), 519, 1993.
17. Goldberg, M. K. and Burstein, M., Heuristic improvement technique for bisection of VLSI networks, IEEE Trans. CAD, 122, 1983.
18. Ghose, M., Zubairm M., and Grosch, C. E., Parallel partitioning of sparse matrices, Comp. Syst. Sci. Eng., 1, 33, 1995.
19. Hendrickson, B. and Leland, R., Amultilevel algorithm for partitioning graphs, Proc. Supercomputing, 1995, pp. 28–41.
20. Karypis, G. and Kumar, V., Analysis of multilevel graph partitioning, Technical Report TR 95-037, Department of Computer Science, University of Minnesota, Minnesota, 1995, pp. 1–19.
21. Alpert, C. J., Hagen, L. W., and Kahng, A. B., A hybrid multilevel/genetic approach for circuit partitioning, Proc. ASPDAC, 1996, p. 298.
22. Alpert, C. J. and Kahng, A. B., Recent directions in netlist partitioning: a survey, Integration, 19, 1, 1995.
23. Alpert, C. J., The ISPD-98 circuit benchmark suite, Proc. ISPD, 1998, p. 80. See errata at http://vlsicad.ucsd.edu/UCLAWeb/cheese/errata.html.
24. Alpert, C. J., Partitioning benchmarks for the VLSICADcommunity, http://vlsicad.ucsd.edu/UCLAWeb/cheese/ispd98.html.
25. Nam, G., Aloul, F. A., Sakallah, K. A., and Rutenbar, R., A comparative study of two Boolean formulations of FPGA detailed routing constraints, Proc. ISPD, 2001, p. 222.
26. Velev, M. and Bryant, R., Superscalar processor verification using reductions of the logic of equality with uninterpreted functions to propositional logic, in Correct Hardware Design and Verification methods, Lecture Notes in Computer Science, Pierre, L., and Kropf, T., eds., Vol. 1703, Springer, Berlin, 1999, pp. 37–53.
27. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., and Malik, S., Chaff: engineering an efficient SAT solver, Proc. Design Autom. Conf. (DAC), 2001, pp. 530–535.
28. Silva, J. and Sakallah, K. A., GRASP: a search algorithm for propositional satisfiability, IEEE Trans. Comp., 48(5), 506, 1999.
29. Bryant, R., Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comp., 35(8), 677, 1986.
30. Prasad, M., Chong, P., and Keutzer, K., Why is ATPG easy? Proc. DAC, 1999, p. 22.
31. Aloul, F. A., Markov, I. L., and Sakallah, K. A., Faster SAT and smaller BDDs via common function structure, Proc. ICCAD, 2001, p. 443.
32. Berman, C., Circuit width, register allocation, and ordered binary decision diagrams, IEEE Trans. CAD, 10(8), 1059, 1991.
33. Aloul, F. A., Markov, I. L., and Sakallah, K. A., MINCE: a static global variable-ordering for SAT search and BDD manipulation, J. Universal Comp. Sci., 10(12), 1559, 2004.
34. Amir, E. and McIlraith, S., Partition-based logical reasoning for first-order and propositional theories, Artif. Intelligence, 162(1–2), 49, 2005.
35. MacCartney, B., McIlraith, S., Amir, E., and Uribe, T. E., Practical partition-based theorem proving for large knowledge bases, Proc. IJCAI, 2003.
36. Caldwell, A. E., Kahng, A. B., and Markov, I. L., Optimal partitioners and end-case placers for standard-cell layout, IEEE Trans. CAD, 19(11), 1304, 2000.
37. Choi, C. and Ye, Y., Application of semidefinite programming to circuit partitioning. Working paper, Department of Management Science, University of Iowa, Iowa, August 1999. http://citeseer.ist.psu.edu/choi99application.html.
38. Donath, W. E. and Hoffman, A. J., Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices, IBM Tech. Disclosure Bull., 15(3), 938, 1972.
39. Eles, P., Peng, Z., Kuchcinski, K., and Doboli, A., System level hardware/software partitioning based on simulated annealing and tabu search, Design Automation for Embedded Syst., 2, 5–32, 1997.
40. Hur, S.W. and Lillis, J., Mongrel: hybrid techniques for standard cell placement, Proc. ICCAD, 2000, p. 165.
41. Yang, H. H. andWong, D. F., Efficient network-flowbased min-cut balanced partitioning, IEEE Trans CAD, 1533, 50–55, 1996.
42. Alpert, C. J. and Kahng, A. B., Multi-way partitioning via spacefilling curves and dynamic programming, Proc. DAC, 1994, p. 652.
43. Hur, S.-W. and Lillis, J., Relaxation and clustering in a local search framework: application to linear placement, VLSI Design, 143, 360–366, 2002.
44. Caldwell, A. E., Kahng, A. B., and Markov, I. L., Design and implementation of the Fiduccia– Mattheyses heuristic for VLSI netlist partitioning, in Proc. ALENEX-99, Algorithm Engineering and Experimentation, Lecture Notes in Computer Science, Goodrich, M. T. and McGeoch, C. C., eds., Vol. 1619, Springer, Berlin, 1999, pp. 177–193.
45. Caldwell, A. E., Kahng, A. B., Kennings, A. A., and Markov, I. L., Hypergraph partitioning for VLSICAD: methodology for heuristic development, experimentation and reporting, Proc. DAC, 1999, p. 349.
46. Caldwell, A. E., Kahng, A. B., and Markov, I. L., Improved algorithms for hypergraph bipartitioning, Proc. ASPDAC, 2000, p. 661.
47. Karypis, G. and Kumar, V., Multilevel k-way hypergraph partitioning, Proc. DAC, 1999, p. 343.
48. Karypis, G. and Kumar, V., hMETIS: a hypergraph partitioning package version 1.5, user manual, 1998, http://glaros.dtc.umn.edu/gkhome/fetch/sw/hmetis/manual.pdf.
49. Han, E.-H., Karypis, G., Kumar, V., and Mobasher, B., Hypergraph based clustering in highdimensional data sets: a summary of results, IEEE Bull. Tech. Comm. Data Eng., 21(1), 15–22, 1998.
50. Cong, J. and Lim, S. K., Edge separability based circuit clustering with application to circuit partitioning, Proc. ASPDAC, 2000, p. 429.
51. Karypis, G., Han, E. H., and Kumar, V., CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling, University of Minnesota, TR #99-007, 1999.
52. Hagen, L. and Kahng, A. B., A new approach to effective circuit clustering, Proc. ICCAD, 1992, p. 422.
53. MLPart: http://vlsicad.ucsd.edu/GSRC/bookshelf/Slots/Partitioning/MLPart/
54. hMETIS: http://www-users.cs.umn.edu/~karypis/metis/hmetis/
55. LEF/DEF Language Reference, product version 5.6, Cadence Design Systems, 2004.
56. UM Physical Design Tools: http://vlsicad.eecs.umich.edu/BK/PDtools/
57. Supplemental illustrations: http://vlsicad.eecs.umich.edu/BK/PART/illustrations/
58. Alpert, C. J., Caldwell, A. E., Kahng, A. B., and Markov, I. L., Hypergraph partitioning with fixed vertices, IEEE Trans. CAD, 19(2), 267, 2000.
59. Karypis, G. and Kumar, V., A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, Journal of Parallel and Distributed Computing, 48, 71–85, 1998.