Tong Jing
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tong Jing has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Gui-Ying Yan
Chinese Academy of Sciences
1 shared publication- HaiYun Bao
Tsinghua University
1 shared publication - JingYu Xu
Tsinghua University
1 shared publication Jingyu Xu
Dept. of CST, Tsinghua Univ., Beijing, China
1 shared publication- Jinjun Xiong
IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, USA
1 shared publication - Jun Gu
Hong Kong University of Science and Technology
1 shared publication
Latest Publications
- 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
- 30 November 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Performance and RLC crosstalk driven global routing
This work presents a global routing algorithm that minimizes total wire length and satisfies RLC crosstalk constraints specified at sinks. Our algorithm is based on critical network concept and search space traversing technology (SSTT) for global routing synthesis and tabu search for shield insertion and net ordering (SINO) to eliminate noise. The algorithm achieves about 20/spl times/ speedup compared with a recent work using iterative deletion based global routing and simulated annealing based SINO. Furthermore, our algorithm increases the wire length by 4% compared with global routing without crosstalk constraints, achieving a 2.5/spl times/ reduction compared with the aforementioned recent work.
- 30 November 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Performance and RLC crosstalk driven global routing
This work presents a global routing algorithm that minimizes total wire length and satisfies RLC crosstalk constraints specified at sinks. Our algorithm is based on critical network concept and search space traversing technology (SSTT) for global routing synthesis and tabu search for shield insertion and net ordering (SINO) to eliminate noise. The algorithm achieves about 20/spl times/ speedup compared with a recent work using iterative deletion based global routing and simulated annealing based SINO. Furthermore, our algorithm increases the wire length by 4% compared with global routing without crosstalk constraints, achieving a 2.5/spl times/ reduction compared with the aforementioned recent work.
- 1 September 2003
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 18 (5) , 632-639
SSTT: Efficient local search for GSI global routing
- 1 September 2003
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 18 (5) , 632-639
SSTT: Efficient local search for GSI global routing