Dennis J.-H. Huang
Andrew B. Kahng
- AHK96.C. J. Alpert, L. W. Hagen, and A. B. Kahng. "A Hybrid Multilevel/Genetic Approach for Circuit Partitioning." In Ptoc. ACM/SIGDA PJ~ydcal Design Workshop, pp. 100-105, 1996.Google Scholar
- Alp96.G.J. Alpert. Multi-way Graph and Hypergraph Partitioning. PhD thesis, University of California, Los Angeles, 1996. Google ScholarDigital Library
- BCL87.T. Bui, S. Chaudhuri, T. Leighton, and M, Sipscr. "Graph Bisection Algorithms with Good Average Case Behavior." Combinatorica, 7(2):171-191, 1987. Google ScholarDigital Library
- Bre76.M. A. Breuer. ':Min-cut Placement." Design Automation and Fault-Tolerant Computing, I(4):343-362, 1976.Google Scholar
- Bre77.M.A. Breuer. "A Class of Min-cut Placement Algorithm for the Placement of Standard Cells," In P~oceedl~gs of the ACM/IEEE Design Automation Conference, pp. 284-290, 1977. Google ScholarDigital Library
- DD96a.S. Dutt and W. Deng. "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques." In Proceedings of tile IEEE/ACM International Conference on Computer-Aided De. sign, pp. 194-200, 1996. Google ScholarDigital Library
- DD96b.S. Dutt and W. Deng. "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques." In Proc, A CM/SIGDA Physical Design Workshop, pp. 92-99, 1996. Also see corresponding Technical Report, Dept. of Electrical Engineering, U. Minnesota.Google Scholar
- DJA94.K. Doll, F. M. Johannes, and K. J. Antreich. "Iterative Placement Improvement by Network Flow Methods." IEEE Transactions on Computer- Aided Design, 13:1189-1200, 1994.Google ScholarDigital Library
- DJS94.K. Doll, F. M. 3ohannes, and G. Sigl. "Iteratire Placement Improvement by Network Flow Methods," IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems, 13(10):1189-1199, 1994.Google Scholar
- DK85.A.E. Dunlop and B. W. Kernighan. "A Procedure for Placement of Standard Cell VLSI Circuits." IEEE Transactions on Computer-Aided Design, 4(1):92-98, 1985.Google Scholar
- FM82.C.M. Fiduccia and R. M. Mattheyses. "A Linear Time Heuristic for Improving Network Partitions." In Proceedings of the ACM/IEEE Design Automation Conference, pp. 175-181, 1982. Google ScholarDigital Library
- HHK95.L. W. Hagen, D. J.-H. Huang, and A. B. Kahng. "On Implementation Choices for Iterative Improvement Partitioning Algorithms." In Proceedings European Design Automation Con~, pp. 144-149, 1995. Google ScholarDigital Library
- KL70.B.W. Kernighan and S. Lin. "An Efficient Heuristic Procedure for Partitioning Graphs." Bell Syst, Tech. J., 49(2):291-307, 1970.Google Scholar
- KSJ91.J. M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich. "GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization." IEEE Transactions on Computer-Aided Design, 10(3):356-365, 1991.Google ScholarDigital Library
- Lau79.U. Lauther. "A Min-cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation." In Proceedings of the 16th Design Automation Conference, pp. 1-10, 1979. Google ScholarDigital Library
- Len90.T. Lenganer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, 1990. Google ScholarDigital Library
- RE95.B.M. Riess and G. G. Ettelt. ``SPEED: Fast and Efficient Timing Driven Placement." In Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 377-380, 1995.Google Scholar
- San89.L. A. Sanchis. "Multiple-Way Network Partitioning." IEEE Transactions on Computers, 38(1):62-81, 1989. Google ScholarDigital Library
- San93.L.A. Sanchis. "Multiple-Way Network Partitioning with Different Cost Functions." IEEE Transactions on Computers, 42(22):1500-1504, 1993. Google ScholarDigital Library
- SDJ91.G. Sigl, K. Doll, and F. M. Johannes. "Analytical Placement: A Linear or a Quadratic Objective Function?" In Proceedings of the ACM/IEEE Design Automation Conference, pp. 427-432, 1991. Google ScholarDigital Library
- SK87a.P.R. Suaris and G. Kedem. "Quadrisection: A New Approach to Standard Cell Layout." in Pracee&'ngs of the IEEE/AUM International Conference on Computer-Aided Design, pp. 474-477, 1987.Google Scholar
- SK87b.P.R. Suaris and G. Kedem. "Standard Cell Placement by Quadrisection." In Proceedings IEEE Intl. Conf. Computer Design, pp. 612-615, 1987.Google Scholar
- SK88.P.R. Suaris and G. Kedem. "An Algorithm for Quadrisection and Its Application to Standard Cell Placement." IEEE Transactions on Circuits and Systems, 35(3}:294-303, 1988.Google Scholar
- SK89.P.R. Suaris and G. Kedem. "A Quadrisectionbased Combined Place and Route Scheme for Standard Cells." IEEE Transactions on Computer-Aided Design, 8(3):234-244. 1989.Google Scholar
- SM91.K. Shahoo'kar and P. Mazumder. ~VLSI Cell Placement Techniques." Computing Surveys, 23(2):143-220, 1991. Google ScholarDigital Library
- SS93.W-J. Sun and C. Sechen. "Efficient and Effective Plzcements for Very Large Circuits." In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pp. 170-177, 1993. Google ScholarDigital Library
- SS95.W. Swartz and C. Sechen. "Timing Driven Placement for Large Standard Cell Circuits." In Proceedings of the ACM/IEEE Design Automation Conference, pp. 211-215, 1995. Google ScholarDigital Library
- Ste97.G. Stenz. 1997. Personal communication.Google Scholar
- Swa96.W. Swartz, 1996. Personal communication.Google Scholar
- TK91.R.-S. Tsay and E. S. Kuh. "A Unified Approach to Partitioning and Placement." IEEE Transactions on Circuits and Systems, 38(5):521-533, 1991.Google ScholarCross Ref
- TKH88.R.-S. Tsay, E. S. Kuh, and C.-P. Hsu. "PROUD: A Sea-of-Gates Placement Algorithm." IEEE Design &: Tes~ of Computers, 5(6):44-56, 1988. Google ScholarDigital Library
Index Terms
- Partitioning-based standard-cell global placement with an exact objective
Recommendations
Consistent placement of macro-blocks using floorplanning and standard-cell placement
ISPD '02: Proceedings of the 2002 international symposium on Physical designWhile a number of recent works address large-scale standard-cell placement, they typically assume that all macros are fixed. Floorplanning techniques are very good at handling macros, but do not scale to hundreds of thousands of placeable objects. ...
Routability driven white space allocation for fixed-die standard-cell placement
ISPD '02: Proceedings of the 2002 international symposium on Physical designThe use of white space in fixed-die standard-cell placement is an effective way to improve routability. In this paper, we present a white space allocation approach that dynamically assigns white space according to the congestion distribution of the ...
Comments