Global objectives for standard cell placement
暂无分享,去创建一个
[1] Andrew B. Kahng,et al. Optimal partitioners and end-case placers for standard-cell layout , 1999, ISPD '99.
[2] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[3] Brian W. Kernighan,et al. A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[4] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[5] Melvin A. Breuer,et al. A class of min-cut placement algorithms , 1988, DAC '77.
[6] G. Kedem,et al. An algorithm for quadrisection and its application to standard cell placement , 1988 .
[7] Shantanu Dutt,et al. Effective partition-driven placement with simultaneous level processing and global net views , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).
[8] Andrew B. Kahng,et al. Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.
[9] Andrew B. Kahng,et al. Partitioning-based standard-cell global placement with an exact objective , 1997, ISPD '97.
[10] Carl Sechen,et al. Efficient and effective placement for very large circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[11] Shashi Shekhar,et al. Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.
[12] Patrick H. Madden. Partitioning by iterative deletion , 1999, ISPD '99.
[13] Laura A. Sanchis,et al. Multiple-Way Network Partitioning with Different Cost Functions , 1993, IEEE Trans. Computers.
[14] Frank M. Johannes,et al. Generic global placement and floorplanning , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).