LEGAL: An algorithm for simultaneous net routing

被引：0

作者：

Johann, MD ^{[1
]}

Reis, RAD ^{[1
]}

机构：

[1] Pontificia Univ Catolica Rio Grande do Sul, Dept Informat, Uruguaiana, RS, Brazil

来源：

14TH SYMPOSIUM ON INTEGRATED CIRCUITS AND SYSTEMS DESIGN, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/SBCCI.2001.953024

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This, paper presents LEGAL, a new routing algorithm that may be specially interesting for area routing problems. It is a generalization of two of the most important channel routing techniques, Left-Edge [3] and Greedy [13] algorithms. Area routing is an important problem today due, to the fact that the availability of several metal layers allows all the routing to be done over the cells [15]. Therefore, the circuit is not partitioned into well defined blocks and routing regions anymore. We seek the use of an algorithm that processes all nets simultaneously as an alternative to standard "net by net" routing or independent Global Cells routing. LEGAL is demonstrated to perform efficiently for small problems in three different implementations, generating complete routing solutions in orders of magnitude less time as compared to maze routers.

引用

页码：180 / 185

页数：6

共 50 条

[1] Net by net routing with a new path search algorithm
Johann, M
Reis, R
13TH SYMPOSIUM ON INTEGRATED CIRCUITS AND SYSTEMS DESIGN, PROCEEDINGS, 2000, : 144 - 149
[2] A LEGAL algorithm following global routing
Johann, MD
dos Santos, GBV
Reis, RAD
15TH SYMPOSIUM ON INTEGRATED CIRCUITS AND SYSTEMS DESIGN, PROCEEDINGS, 2002, : 271 - 276
[3] An algorithm for simultaneous pin assignment and routing
Xiang, H
Tang, XP
Wong, DF
ICCAD 2001: IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, 2001, : 232 - 238
[4] Ant-net: An Adaptive Routing Algorithm
Chandana, M.
Thakur, Sanjeev
PROCEEDINGS OF THE FIRST IEEE INTERNATIONAL CONFERENCE ON POWER ELECTRONICS, INTELLIGENT CONTROL AND ENERGY SYSTEMS (ICPEICES 2016), 2016,
[5] A new global routing algorithm independent of net ordering
Bao, HY
Hong, XL
Cai, YC
PROCEEDINGS OF ASP-DAC '99: ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE 1999, 1999, : 245 - 248
[6] Simultaneous Routing and Feedthrough Algorithm to Decongest Top Channel
Prasad, Shashank
Kumar, Anuj
22ND INTERNATIONAL CONFERENCE ON VLSI DESIGN HELD JOINTLY WITH 8TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS, PROCEEDINGS, 2009, : 399 - 403
[7] A standard cell global routing algorithm with net selection for over-the-cell routing
Koide, T
Suzuki, T
Wakabayashi, S
Yoshida, N
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1995, 78 (12): : 102 - 115
[8] A timing-constrained simultaneous global routing algorithm
Hu, J
Sapatnekar, SS
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2002, 21 (09) : 1025 - 1036
[9] Simultaneous Escape Routing Based on Routability-Driven Net Ordering
Yan, Jin-Tai
Sung, Tung-Yen
Chen, Zhi-Wei
2011 IEEE INTERNATIONAL SOC CONFERENCE (SOCC), 2011, : 81 - 86
[10] A simultaneous routing tree construction and fanout optimization algorithm
Salek, AH
Lou, J
Pedram, M
1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 625 - 630

← 1 2 3 4 5 →