Xiao-Dong Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiao-Dong Hu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Gui-Ying Yan
Chinese Academy of Sciences
1 shared publication- Jinjun Xiong
College of AI, Cyber and Computing, The University of Texas at San Antonio, San Antonio, TX, USA
1 shared publication - Lei He
Eastern Institute of Technology, Ningbo, Zhejiang, China
1 shared publication - Tong Jing
Tsinghua University
1 shared publication - Tong Jing
Computer Science & Technology Department, Tsinghua University, Beijing 100084, China. Phone: +86-10-62785564; Electrical Engineering Department, UCLA, Los Angeles, CA, 90095, USA. Phone: (310) 267-5407
1 shared publication Xian-Long Hong
Tsinghua University
1 shared publication
Latest Publications
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21536961,p. 256-261
DpRouter: A Fast and Accurate Dynamic-Pattern-Based Global Routing Algorithm
This paper presents a fast and accurate global routing algorithm, DpRouter, based on two efficient techniques: (1) dynamic pattern routing (Dpr), and (2) segment movement. These two techniques enable DpRouter to explore large solution space to achieve better routability with low time complexity. Compared with the state-of-the-arts, experimental results show that we consistently obtain better routing quality in terms of both congestion and wire length, while simultaneously achieving a more than 30x runtime speedup. We envision that this algorithm can be further leveraged in other routing applications, such as FPGA routing.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21536961,p. 256-261
DpRouter: A Fast and Accurate Dynamic-Pattern-Based Global Routing Algorithm
This paper presents a fast and accurate global routing algorithm, DpRouter, based on two efficient techniques: (1) dynamic pattern routing (Dpr), and (2) segment movement. These two techniques enable DpRouter to explore large solution space to achieve better routability with low time complexity. Compared with the state-of-the-arts, experimental results show that we consistently obtain better routing quality in terms of both congestion and wire length, while simultaneously achieving a more than 30x runtime speedup. We envision that this algorithm can be further leveraged in other routing applications, such as FPGA routing.
- 1 January 2006
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 21 (1) , 147-152
ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm
- 1 January 2006
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 21 (1) , 147-152
ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm