참고문헌
- A. E. Caldwell, A. B. Kahng, and Igor L. Markov, 'Can Recursive Bisection Alone Produce Routable Placements?,' Proc. of DAC, pp.477-482, 2000 https://doi.org/10.1145/337292.337549
- D. J. -H. Huang and A. B. Kahng, 'Partitioning-Based Standard-Cell Global Placement with an Exact Objective,' Proc. of ISPD, pp.18-25, 1997 https://doi.org/10.1145/267665.267674
- M. C. Yildiz and P. H. Madden 'Improved Cut Sequences for Partitioning Based Placement,' Proc. of DAC, pp.776-729, 2001 https://doi.org/10.1145/378239.379064
- X. Yang, M. Wang,? K. Egur and M. Sarrafzadeh, 'A Snap-on Placement Tool,' Proc. of ISPD, pp.153-158, 2000 https://doi.org/10.1145/332357.332392
- Ke Zhong and S. Dutt, 'Effective Partition-Driven Placement with Simultaneous Level Processing and a Global Net Views,' Proc. of ICCAD, pp.254-259, 2000 https://doi.org/10.1109/ICCAD.2000.896482
- A. E. Caldwell, A. B. Kahng and I. L. Markov, 'Optimal End-Case Partitioners and Placers for Standard-Cell Layout,' Proc. of ISPD, pp.90-96, 1999 https://doi.org/10.1145/299996.300032
- B. W. Kernighan and S. Lin, 'An Efficient Heuristic Procedure for Partitioning Graphs,' Bell Syst. Tech. J., Vol.49 No.2, pp.291-307, 1970 https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
- C. M. Fiduccia and R. M. Matteyses, 'A Linear Time Heuristic for Improving Network Partitions,' Proc. of DAC, pp.175-181, 1982
- Y. G. Saab, 'A Fast Clustering-Based Min-Cut Placement Algorithm with Simulated Annealing Performance,' VLSI Design, Vol.5, No.1, pp.37-48, 1996 https://doi.org/10.1155/1996/58084
- Wern-Jieh and Carl Sechen, 'Efficient and Effective Placement for Very Large Circuits,' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp.349-359, 1995 https://doi.org/10.1109/43.365125
- S. Goto, 'An Efficient Algorithm for the Two-Dimensional Placement Problem in Electrical Circuit Layout,' IEEE Trans. Circuits and Systems, CAS-28, pp.12-18, 1981 https://doi.org/10.1109/TCS.1981.1084903
- H. Eisenmann and F. M. Johannes, 'Generic Global Placement and Floorplanning,' Proc. of DAC, pp.269-274, 1998 https://doi.org/10.1145/277044.277119
- H. Etawil, S. Arebi, and A. Vannelli, 'Attractor-Repeller Approach for Global Placement,' Proc. of ICCAD, pp.20-24, 1999 https://doi.org/10.1109/ICCAD.1999.810613
- Maogang Wang, X. Yang, Ken Eguro, and M. Sarrafzadeh, 'Dragon2000: Placement of Industrial Circuits,' Proc. of ICCAD, pp 260-263, 2000
- X. Yang, B-K. Choi, and M. Sarrafzadeh, 'A Standard-Cell Placement Tool for Designs with High Row Utilization,' International Conference on Computer Design, pp.45-49 2002 https://doi.org/10.1109/ICCD.2002.1106746
- S. Hur and J. Lillis, 'Mongrel: Hybrid Techniques for Standard Cell Placement,' Proc. of ICCAD, pp.165-170, 2000 https://doi.org/10.1109/ICCAD.2000.896468
- G. Meixner and U. Lauther, 'Congestion-Driven Placement Using a New Multi-Partitioning Heuristic,' Porc. of ICCAD, pp.332-335, 1990 https://doi.org/10.1109/ICCAD.1990.129917
- Maogang Wang, Xiaojian Yang, Majid Sarrafzadeh, 'Congestion Minimization During Placement,' IEEE Trans. CAD of Integrated Circuits and Systems, Vol.19, No.10, pp.1140-1148, 2000 https://doi.org/10.1109/43.875296
- M. Wang and M. Sarrafzadeh, 'Modeling and Minimization of Routing Congestion,' Proc. of ASP-DAC, pp.185-190, 2000 https://doi.org/10.1109/ASPDAC.2000.835094
- M. Wang and M. Sarrafzadeh, 'On the Behavior of Congestion Minimization During Placement,' Proc. of International Symposium on Physical Design, pp.145-150, 1999 https://doi.org/10.1145/299996.300044
- C.C.Chang, Jason Cong, Zhigang Pan, Zin Yuan, 'Multilevel Global Placement With Congestion Control,' IEEE Trans. CAD of Integrated Circuits and Systems, Vol.22, No.4, pp.395-409, 2003 https://doi.org/10.1109/TCAD.2003.809661
- Jason Cong and Majid Sarrafzadeh, 'Incremental Physical Design,' Proc. of ISPD, pp.84-92, 2000 https://doi.org/10.1145/332357.332379
- Olivier Coudert, Jason Cong, Sharad Malik, and Majid Sarrafzadeh, 'Incremental CAD,' Proc. of ICCAD, pp.236-243, 2000 https://doi.org/10.1109/ICCAD.2000.896480
- Ulrich Brenner & Andre Rohe, 'An Effective Congestion-Driven Placement Framework,' IEEE Trans. CAD of Integrated Circuits and Systems, Vol.22, No.4, pp.387-394, 2003 https://doi.org/10.1109/TCAD.2003.809662
- P. N. Parakh, R. B. Brown and Karem A. Sakallah, 'Congestion Driven Quadratic Placement,' Proc. of DAC, pp.275-278, 1998 https://doi.org/10.1145/277044.277121
- Wenting How, Hong Yu, Xianlong Hong, Yici Cai, Weimin Wu, Jun Gu, bunch, and William H.Kao, 'A New Congestion Driven Placement Algorithm Based on Cell Inflation,' Proc. of ASP-DAC, pp.605-608, 2001 https://doi.org/10.1109/ASPDAC.2001.913375
- Andrew B. Kahng and Xu Xu, 'Accurate Pseudo-Constructive Wirelength and Congestion Estimation,' ACM International Workshop on System-Level Interconnect Prediction, pp.61-68, 2003 https://doi.org/10.1145/639929.639942
- Chris C. N. Chu, 'FLUTE: Fast Lookup Table Based Wirelength Estimation Technique,' Proc. ICCAD, pp.696-701, 2004 https://doi.org/10.1109/ICCAD.2004.1382665
- Chris Chu and Yiu-Chung Wong, 'Fast and Accurate Rectilinear Steiner Minimal Tree Algorithm for VLSI Design,' Proc. ISPD, pp.28-35, 2005 https://doi.org/10.1145/1055137.1055145
- M. Wang, X. Yang, K Eguro and M. Sarrafzadeh, 'Multi-center Congestion Estimation and Minimization During Placement,' Proc. ISPD, pp.147-152, 2000 https://doi.org/10.1145/332357.332391
- Xiaojian Yang, Ryan Kastner, M.Sarrafzadeh, 'Congestion Reduction During Placement Based on Integer Programming,' Proc. ICCAD, pp.573-576, 2001 https://doi.org/10.1109/ICCAD.2001.968712