Minimum replication min-cut partitioning

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

Volumn 16, Issue 10, 1997, Pages 1221-1227

  Mak, Wai Kei ^a   Wong, D F ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001151233     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.662685     Document Type: Article

References (11)

1. B. Preas and M. Lorenzetti, Physical Design Automation of VLSI Systems. Redwood City, CA: Benjamin-Cummings, 1988.
2. B. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning of electrical circuits," Bell Syst. Tech. ]., pp. 291-307, Feb. 1970.
3. C. M. Fiduccia and R. M. Mattheyses, "A linear time heuristic for improving network partitions," in P roc. 19th Design Automation Conf., 1982, pp. 175-181.
4. J. Cong, L. Hagen, and A. Kahng, "Net partitions yield better module partitions," in Proc. 29th Design Automation Conf., 1992, pp. 47-52.
5. C. Kring and A. R. Newton, "A cell-replicating approach to mincut-based circuit partitioning," in Proc. IEEE Int. Conf. Computer-Aided Design, 1991, pp. 2-5.
6. J. Hwang and A. El Gamal, "Min-cut replication in partitioned networks," IEEE Trans. Computer-Aided Design, vol. 14, pp. 96-106, Jan. 1995.
7. H. Yang and D. F. Wong, "New algorithms for min-cut replication in partitioned circuits," in Proc. IEEE Int. Conf. on Computer-Aided Design, 1995, pp. 216-222.
8. L. T. Liu, M. T. Kuo, C. K. Cheng, and T. C. Hu, "A replication cut for two-way partitioning," in IEEE Trans. Computer-Aided Design, vol. 14, pp. 623-630, May 1995.
9. J. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
10. A. W. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," J. ACM, vol. 35, no. 4, pp. 921-940, Oct. 1988.
11. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, pp. 671-680, May 1983.