Shantanu Dutt
- 1.C.J. Alpert and A.B. Kahng, "A general framework for vertex orderings, with applications to circuit clusterings", Proc. IEEE/ACM International Conference on CAD, Nov. 1994, pp. 63-67. Google Scholar
Digital Library
- 2.C.J. Alpert and S-Z Yao, "Spectral Partitioning: The more eigenvectors the better", Proc. Design Automation Conf., 1995, pp. 195-200. Google ScholarDigital Library
- 3.D. G. Schweikert and B. W. Kernighan, "A Proper Model for the Partitioning of Electrical Circuits", Proc. 9th Design automation workshop, 1972, pp. 57-62. Google ScholarDigital Library
- 4.S. Dutt, "New faster Kernighan-Lin-type graph-partitioning algorithms", Proc. IEEE/ACM International Conference on CAD, Nov. 1993. Google ScholarDigital Library
- 5.S. Dutt and W. Deng, "A Probability-Based Approach to VLSI Circuit Partitioning", Tech. Report, EE Dept., Univ. of Minnesota, 1996- available at ftp site ftp-mount.ee.umn.edu in file/pub/faculty/dutt/vlsicad/papers/dac96-ext.ps.Google ScholarDigital Library
- 6.C.M. Fidducia and R.M. Mattheyses, "A linear-time heuristic for improving network partitions", Proc. Nineteenth Design Automation Conf., 1982, pp. 175-181. Google ScholarDigital Library
- 7.L. Hagen and A. Kahng, "Fast spectral methods for ratio cut partitioning and clustering", Proc. Int' l. Conf. Computer-Aided Design, 1991, pp. 10- 13.Google ScholarCross Ref
- 8.M.A.B. Jackson, A. Srinivasan and E.S. Kuh, "A fast algorithm for performance driven placement", Proc. IEEE/ACM International Conference on CAD, 1990, pp. 328-331.Google ScholarCross Ref
- 9.B.W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs", Bell System Tech. Journal, vol. 49, Feb. 1970, pp. 291-307.Google Scholar
- 10.B. Krishnamurthy, "An improved min-cut algorithm for partitioning VLSI networks", IEEE Trans. on Comput., vol. C-33, May 1984, pp. 438-446.Google Scholar
- 11.B.M. Riess, K. Doll and F.M. Johannes, "Partitioning very large circuits using analytical placement techniques", Proc. ACM/IEEE Design Automation Conf., 1994, pp. 646-651. Google ScholarDigital Library
- 12.C. Sechen, VLSI Placement and Global Routing Using Simulated Annealing, Kluwer, B.V., Deventer, The Netherlands.Google Scholar
- 13.Y.C. Wei and C.K. Cheng, "Towards efficient hierarchical designs by ratio cut partitioning", Proc. Int'l. Conf. Computer-Aided Design, 1989, pp. 298-301.Google Scholar
- 14.Y.C. Wei and C.K. Cheng, "A two-level two-way partitioning algorithm", Proc. Int'l. Conf. Computer-Aided Design, 1990, pp. 516-519.Google Scholar
Index Terms
- A probability-based approach to VLSI circuit partitioning
Recommendations
Corolla based circuit partitioning and resynthesis
DAC '90: Proceedings of the 27th ACM/IEEE Design Automation ConferenceThis paper introduces a circuit partitioning method based on analysis of reconvergent fanout. We consider a DAG model for a circuit. We define a corolla as a set of overlapping reconvergent fanout regions. We partition the DAG into a set of non-...
Comments