Track assignment: A desirable intermediate step between global routing and detailed routing

被引:57
作者
Batterywala, S [1 ]
Shenoy, N [1 ]
Nicholls, W [1 ]
Zhou, H [1 ]
机构
[1] Synopsys Inc, Mt View, CA 94043 USA
来源
IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS | 2002年
关键词
D O I
10.1109/ICCAD.2002.1167514
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Routing is one of the most complex stages in the back-end design process. Simple routing algorithms based on two stages of global routing and detailed routing do not offer appropriate opportunities to address problems arising from signal delay, cross-talk and process constraints. An intermediate stage of track assignment between global and detailed routing proves to be an ideal place to address these problems. With this stage it is possible to use global routing information to efficiently address these problems and to aid the detailed router in achieving the wiring completions. In this paper we formulate routing as a three stage process; global routing, track assignment and detailed routing. We describe the intermediate track assignment problem and suggest an efficient heuristic for its solution. We introduce cost metrics to model basic effects arising from connectivity. We discuss extensions to include signal integrity and process constraints. We propose a heuristic based on weighted bi-partite matching as a core routine. To improve its performance additional heuristics based on lookahead and segment splitting are also suggested. Experimental results are given to highlight the efficacy of track assignment stage in routing process.
引用
收藏
页码:59 / 66
页数:8
相关论文
共 23 条
[1]  
[Anonymous], 2001, GRAPH THEORY
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
[Anonymous], ALGORITHMS VLSI PHYS
[4]  
Bakoglu H., 1990, CIRCUITS INTERCONNEC
[5]   An efficient approach to multilayer layer assignment with an application to via minimization [J].
Chang, CC ;
Cong, J .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (05) :608-620
[6]  
CHANG CC, 2000, INT S PHYS DES, P41
[7]  
CHO JD, 1993, CUST INT CIRC C
[8]  
CISSIELSKI MJ, 1989, IEEE T CAD, V8, P701
[9]  
Cong J., 2000, INT S PHYS DES, P12
[10]   THE COMPLEXITY OF COLORING CIRCULAR ARCS AND CHORDS [J].
GAREY, MR ;
JOHNSON, DS ;
MILLER, GL ;
PAPADIMITRIOU, CH .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (02) :216-227