Ratio Cut Partitioning for Hierarchical Designs

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

Volumn 10, Issue 7, 1991, Pages 911-921

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL PROGRAMMING, LINEAR;

CIRCUIT PARTITIONING; HEURISTIC ALGORITHMS; HIERARCHICAL VLSI DESIGN; RATIO CUT PARTITIONING;

INTEGRATED CIRCUITS, VLSI;

EID: 0026191188     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.87601     Document Type: Article

References (23)

1. B. Bollobas, Random Graphs. New York: Academic, 1985, pp. 11–12, 31–53.
2. R. Camposano and R. K. Brayton, “Partitioning before logic synthesis,” in Proc. Int. Conf. on Computer-Aided Design, 1987, pp. 324–326.
3. H. R. Charney and D. L. Plato, “Efficient partitioning of components,” IEEE Design Automation, pp. 16.0-16.21, July 1968.
4. C. K. Cheng and T. C. Hu, “Maximum concurrent flow and minimum ratio cut,” Tech. Rep. CS88-141, Dec., 1988.
5. V. Chvatal, Linear Programming. San Francisco, CA: Freeman, 1983.
6. W. M. Dai and E. S. Kuh, “Simultaneous floor planning and global routing for hierarchical building-block layout,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 828–837, 1987.
7. W. E. Donath, “Logic partitioning,” in Physical Design Automation of VLSI Systems, B. Preas and M. Lorenzetti, ed. Menlo Park, CA: Benjamin/Cummings, 1988, pp. 65–86.
8. C. M. Fiduccia and R. M. Mattheyses, “A linear time heuristic for improving network partitions,” in Proc. I9th Design Automation Conf., 1982, pp. 175–-181.
9. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton University, 1962.
10. J. Frankie and R. M. Karp, “Circuit placement and cost bounds by eigenvector decomposition,” in Proc. Int. Conf. on Computer-Aided Design, 1986, pp. 414–417.
11. J. Hennessy, “Partitioning programmable logic arrays summary,” in Proc. Int. Conf. on Computer-Aided Design, 1983, pp. 180–181.
12. M. Iri, “On an extension of the maximum flow minimum cut theorem to multicommodity flows,” J. Oper. Res. Soc. Japan, vol. 5, no. 4, pp. 697–703, Dec. 1967.
13. B. W. Kemighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, no. 2, pp. 291–307, Feb. 1970.
14. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Sci., vol. 220, pp. 671–680, 1983.
15. B. Krishnamurthy, “An improved min-cut algorithm for partitioning VLSI networks,” IEEE Trans. Comput., vol. C-33, pp. 438–446, May 1984.
16. D. W. Matula and F. Shahrokhi, “The maximum concurrent flow problem and sparsest cuts,” Tech. Rep., Southern Methodist Univ., 1986.
17. M. C. McFarland, “Computer-aided partitioning of behavioral hardware description,” in Proc. 20th Design Automation Conf., 1983, pp. 474–478.
18. K. Onaga and O. Kakusho, “On feasibility conditions of multicommodity flows in networks,” IEEE Trans. Circuit Theory, vol. CT-18, pp. 425–429, 1971.
19. L. A. Sanchis, “Multi-way network partitioning,” IEEE Trans. Comput., vol. 38, pp. 62–81, Jan. 1989.
20. D. M. Schuler and E. G. Ulrich, “Clustering and linear placement,” in Proc. 9th Design Automation Workshop, 1972, pp. 50–56.
21. D. G. Schweikert and B. W. Kernighan, “A proper model for the partitioning of electrical circuits,” in Proc. 9th Design Automation Workshop, 1972, pp. 57–62.
22. C. Sechen and D. Chen, “An improved objective function for mincut circuit partitioning,” in Proc. Int. Conf. on Computer-Aided Design, 1988, pp. 502–505.
23. J. E. Stevens, “Fast heuristic techniques for placing and wiring printed circuit boards,” Ph.D. dissertation, Comp. Sci. Dep. Univ. Illinois, 1972.