Multiway Partitioning Via Geometric Embeddings, Orderings, and Dynamic Programming

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

Volumn 14, Issue 11, 1995, Pages 1342-1358

  Alpert, Charles J ^a   Kahng, Andrew B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; DYNAMIC PROGRAMMING; EIGENVALUES AND EIGENFUNCTIONS; GEOMETRY; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; SET THEORY;

GEOMETRIC EMBEDDINGS; HYPERGRAPH; MULTIWAY PARTITIONING;

INTEGRATED CIRCUIT LAYOUT;

EID: 0029408448     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.469661     Document Type: Article

References (48)

1. C. J. Alpert and A. B. Kahng, “Geometric embeddings for faster (and better) multiway netlist partitioning,” UCLA CSD TR-920052, Oct. 1992; abbreviated version appeared in Proc. ACM/IEEE Design Automat. Conf., June 1993, pp. 743–748.
2. C. J. Alpert and A. B. Kahng, “Multiway netlist partitioning using spacefilling curves,” UCLA CSD TR-930016, June 1993; abbreviated version appeared in Proc. ACM/IEEE Design Automat. Conf., June 1994, pp. 652–657.
3. C. J. Alpert and A. B. Kahng, “Recent directions in netlist partitioning: A survey,” to appear in Integration: The VLSI J., 1995.
4. S. T. Barnard and H. D. Simon, “A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems,” NASA AMES Research Center, Tech. Rep. RNR-92-033, Nov. 1992.
5. J. J. Bartholdi and L. K. Platzman, “Heuristics based on spacefilling curves for combinatorial problems in Euclidean space,” Management Sci., vol. 34, pp. 291–305, Mar. 1988.
6. J. L. Bentley, “Fast algorithms for geometric traveling salesman problems,” ORSA J. Computing, vol. 4, no. 4, pp. 387–410, 1992.
7. D. Bertsimas and M. Grigni, “Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem,” Operations Res. Lett., vol. 8, no. 5, pp. 241–244, Oct. 1989.
8. J. P. Benzécri, “Construction d'une classification ascendante hiérarchique par la rechereche en chaine des voisins réciproques,” Les Cahiers de l'Analyse des Données vol. 7, no. 2, pp. 209–218, 1982.
9. T. N. Bui, “Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms,” in Proc. ACM/IEEE Design Automat. Conf., June 1989, pp. 775–778.
10. P. Brucker, “On the complexity of clustering problems,” Optimization Operations Res., 1977, pp. 45–54.
11. P. K. Chan, personal communication, Nov. 1994.
12. P. K. Chan, M. D. F. Schlag, and J. Zien, “Spectral K-way ratio-cut partitioning and clustering,” IEEE Trans. Computer-Aided Design, vol. 13, no. 9, pp. 1088–1096, Sept. 1994. (Some experimental results are quoted from: J. Zien, “Spectral K-way ratio cut graph partitioning,” M.S. thesis, Computer Eng. Dept., Univ. California, Santa Cruz, Mar. 1993.)
13. H. R. Charney and D. L. Plato, “Efficient partitioning of components,” in Proc. IEEE Design Automation Workshop, 1968, pp. 16-0–16-21.
14. C. K. Cheng and Y. C. Wei, “An improved two-way partitioning algorithm with stable performance,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 1502–1511, Dec. 1991.
15. H. L. Davidson and E. Kelly, personal communication, Sun Microsystems Labs, July 1993.
16. C.-L. Ding, C.-Y. Ho, and M. J. Irwin, “A new optimization driven clustering algorithm for large circuits (extended abstract),” Proc. 4th ACM/SIGDA Physical Design Workshop, 1993, pp. 13–19.
17. W. E. Donath, “Logic partitioning,” in Physical Design Automation of VLSI Syst., B. Preas and M. Lorenzetti, Eds. New York: Benjamin-Cummings, 1988, pp. 65–86.
18. T. Feder and D. H. Greene, “Optimal algorithms for approximate clustering,” Proc. 20th Ann. ACM Symp. Theory Computing, 1988, pp. 434–444.
19. C. M. Fiduccia and R. M. Mattheyses, “A linear time heuristic for improving network partitions,” Proc. ACM/IEEE Design Automat. Conf., June 1982, pp. 175–181.
20. J. Frankle and R. M. Karp, “Circuit placement and cost bounds by eigenvector decomposition,” Proc. IEEE Int. Conf. Computer-Aided Design, Nov. 1986, pp. 414–417.
21. T. F. Gonzalez, “Clustering to minimize the maximum intercluster distance,” Theoretical Comput. Sci., vol. 38, pp. 293–306, 1985.
22. A. Guénoche, P. Hansen, and B. Jaumard, “Efficient algorithms for divisive hierarchical clustering with the diameter criterion,” J. Classification, vol. 8, pp. 5–30, 1991.
23. S. W. Hadley, B. L. Mark, and A. Vanelli, “An efficient eigenvector approach for finding netlist partitions,” IEEE Trans. Computer-Aided Design, vol. 11, pp. 885–892, July 1992.
24. L. Hagen, Circuit Partitioning, Ph.D. dissertation, Computer Science Dept., Univ. California, Los Angeles, 1994.
25. 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.
26. L. Hagen and A. B. Kahng, “A new approach to effective circuit clustering,” in Proc. IEEE Int. Conf. Computer-Aided Design, Nov. 1992, pp. 422–427.
27. K. M. Hall, “An r-dimensional quadratic placement algorithm,” Manag. Sci., vol. 17, pp. 219–229, 1970.
28. M. Hanan, P. K. Wolff, and B. J. Agule, “A study of placement techniques,” J. Design Automat. Fault-Tolerant Computing, vol. 2, pp. 28–61, 1978.
29. J. Hershberger, “Minimizing the sum of diameters efficiently,” in Proc. 3rd Canadian Conf. Computat. Geometry, 1991, pp. 62–65.
30. J. Huang, personal communication, 1992.
31. S. C. Johnson, “Hierarchical clustering schemes,” Psychometrika, vol. 32, no. 3, pp. 241–254, 1967.
32. R. M. Karp, “Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane,” Mathemat. Operations Res., vol. 2, no. 3, pp. 209–224, 1977.
33. E. L. Lawler, J. K. Lenstra, A. Rinnooy-Kan, and D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester, UK: Wiley, 1985.
34. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. New York: Wiley, 1990.
35. S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations Res., vol. 21, pp. 498–516, 1973.
36. N. Megiddo and K. J. Supowit, “On the complexity of some common geometric location problems,” SIAM J. Computing, vol. 13, no. 1, pp. 182–196, 1984.
37. T.-K. Ng, J. Oldfield, and V. Pitchumani, “Improvements of a mincut partition algorithm,” in Proc. IEEE Int. Conf. Computer-Aided Design, 1987, pp. 479–473.
38. A. Pothen, H. D. Simon, and K. P. Liou, “Partitioning sparse matrices with eigenvectors of graphs,” SIAM J. Matrix Anal. Appl., vol. 11, pp. 430–452, 1990.
39. F. P. Preparata and M. I. Shamos, Computational Geometry. New York: Springer Verlag, 1985.
40. G. Reinelt, “Fast Heuristics for large geometric traveling salesman problems,” ORSA J. Computing, vol. 4, no. 2, pp. 206–217, 1992.
41. L. A. Sanchis, “Multiple-way network partitioning,” IEEE Trans. Computers, vol. 38, no. 1, pp. 62–81, 1989.
42. D. G. Schweikert and B. W. Kernighan, “A proper model for the partitioning of electrical circuits,” in Proc. ACM/IEEE Design Automat. Conf., 1972, pp. 57–62.
43. D. S. Scott, “LASO2 documentation,” Computer Science Dept., Univ. Texas, Austin, Tech. Rep. 1980.
44. W. Sun and C. Sechen, “Efficient and effective placements for very large circuits,” in Proc. IEEE Int. Conf. Computer-Aided Design, Nov. 1993, pp. 170–177.
45. R.-S. Tsay and E. S. Kuh, “A unified approach to partitioning and placement,” IEEE Trans. Circuits Syst., vol. 38, no. 5, pp. 521–533, 1991.
46. Y. C. Wei and C. K. Cheng, “Ratio cut partitioning for hierarchical designs,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 911–921, July 1991.
47. C. W. Yeh, C. K. Cheng, and T. T. Lin, “A general purpose multiple way partitioning algorithm,” in Proc. ACM/IEEE Design Automat. Conf., June 1991, pp. 421–426.
48. C. W. Yeh, C. K. Cheng, and T. T. Lin, “A probabilistic multicommodity-flow solution to circuit clustering problems,” in Proc. IEEE Int. Conf. on Computer-Aided Design, Nov. 1992, pp. 428–431.