參考文獻 |
[1] Jarrod A. Roy, David A. Papa, Saurabh N. Adya, Haward, H. Chan, Aaron N. Ng, James F. Lu, and Igor L. Markov, “Capo: Robust and scalable open-source min-cut floorplacer,” in Proceedings of International Symposium on Physical Design, pp. 224–226, 2005.
[2] Taraneh Taghavi, Xiaojian Yang, Bo-Kyung Choi, Maogang Wang and Majid Sarrafzadeh, “Dragon2005: Large Scale Mixed-Sized Placement Tool,” in Proceedings of International Symposium on Physical Design, pp. 42-47, 2005.
[3] Meng-Kai Hsu, Yi-Fang Chen, Chau-Chin Huang, Tung-Chieh Chen, and Yao-Wen Chang, “Routability-Driven Placement for Hierarchical Mixed-Size Circuit Designs,” in Proceedings of Design Automation Conference, pp. 1-6, 2013.
[4] Yi-Lin Chuang, Gi-Joon Nam, Charles J. Alpert, Yao-Wen Chang, Jarrod Roy, and Natarajan Viswanathan, “Design-hierarchy Aware Mixed-size Placement for Routability Optimization,” in Proceedings of International Conference on Computer-Aided Design, pp. 663-668, 2010.
[5] Myung-Chul Kim, Jin Hu, Dong-Jin Lee, and Igor L. Markov, “A SimPLR Method for Routability-driven Placement,” in Proceedings of International Conference on Computer-Aided Design, pp. 67-73, 2011.
[6] Yu-Min Lee, Tsung-You Wu, and Po-Yi Chiang, “A Hierarchical Bin-Based Legalizer for Standard-Cell Designs with Minimal Disturbance,” in Proceedings of Asia and South Pacific Design Automation Conference, pp. 568-573, 2010.
[7] Peter Spindler and Frank M. Johannes, “Fast and Accurate Routing Demand Estimation for Efficient Routability-driven Placement,” in Proceedings of Design, Automation & Test in Europe Conference & Exhibition, pp. 1-6, 2007.
[8] Kalliopi Tsota, Cheng-Kok Koh, and Venkataramanan Balakrishnan, “Guiding global placement with wire density,” in Proceedings of International Conference on Computer-Aided Design, pp. 212-217, 2008.
[9] Sung-Woo Hur and John Lillis, “Mongrel: Hybrid Techniques for Standard Cell Placement,” in Proceedings of International Conference on Computer-Aided Design, pp. 165-170, 2000.
[10] Andrew B. Kahng, Igor L. Markov, and Sherief Reda, “On Legalization of Row-based Placements,” in Proceedings of Great Lakes symposium on VLSI, pp. 214-219, 2004.
[11] Andrew B. Kahng, Paul Tucke, and Alex Zelikovsky, “ Optimization of Linear Placements for Wirelength Minimization with Free Sites,” in Proceedings of Asia and South Pacific Design Automation Conference, pp. 241-244, 1999.
[12] Ulrich Brenner, “VLSI Legalization with Minimum Perturbation by Iterative Augmentation,” in Proceedings of Design, Automation & Test in Europe Conference & Exhibition, pp. 1385-1390, 2012.
[13] Ulrich Brenner and Jens Vygen, “Legalizing A Placement with Minimum Total Movement,” in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 23, no. 12, pp. 1597-1613, 2004.
[14] Peter Spindler, Ulf Schlichtmann, and Frank M. Johannes, “Abacus: Fast Legalization of Standard Cell Circuits with Minimal Movement,” in Proceedings of International Symposium on Physical Design, pp. 47-53, 2008.
[15] Jarrod A. Roy, Natarajan Viswanathan, Gi-Joon Nam, Charles J. Alpert, and Igor L. Markov, “CRISP: Congestion Reduction by Iterated Spreading During Placement,” in Proceedings of International Conference on Computer-Aided Design, pp. 357-362, 2009.
[16] Yanheng Zhang and Chris Chu, “ Crop: Fast and Effective Congestion Refinement of Placement,” in Proceedings of International Conference on Computer-Aided Design, pp. 344-350, 2009.
[17] Xu He, Tao Huang, Linfu Xiao, Haitong Tian, Guxin Cui, and Evangeline F.Y. Young, “Ripple: An Effective Routability-driven Placer by Iterative Cell Movement,” in Proceedings of International Conference on Computer-Aided Design, pp. 74-79, 2011.
[18] Jason Cong, Guojie Luo, Kalliopi Tsota, and Bingjun Xiao, “Optimizing Routability in Large-Scale Mixed-Size Placement,” in Proceedings of Asia and South Pacific Design Automation Conference, pp. 441-446, 2013.
[19] Ümit Çatalyürek and Cevdet Aykanat, “PaToH(Partitioning Tool for Hypegraphs),” Encyclopedia of Parallel Computing, pp. 1479-1487, 2011.
[20] Wen-Hao Liu, Cheng-Kok Koh, and Yih-Lang Li, “Case Study for Placement Solutions in ISPD11 and DAC12 Routability-Driven Placement Contests,” in Proceedings of International Symposium on Physical Design, pp.114-119, 2013.
[21] George Karypis and Vipin Kumar, “Multilevel k-way Hypergraph Partitioning,” in Proceedings of Design Automation Conference, pp.343-348, 1999.
[22] A. E. Caldwell, A. B. Kahng, and I. L. Markov, “Can recursive bisection a lone produce routable placements,” in Proceedings of Design Automation Conference., pp.260-263, 2000.
[23] Natarajan Viswanathan, Charles J. Alpert, Cliff C. N. Sze, Zhuo Li and Yaoguang Wei, “The DAC 2012 Routability-driven Placement Contest and Benchmark Suite,” in Proceedings of Design Automation Conference, pp. 774-782, 2012.
|