Sciweavers

180 search results - page 2 / 36
» Measuring routing congestion for multi-layer global routing
Sort
View
TCAD
2002
73views more  TCAD 2002»
13 years 5 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
CAL
2004
13 years 5 months ago
Globally Adaptive Load-Balanced Routing on Tori
We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information. In contrast, most...
Arjun Singh, William J. Dally, Brian Towles, Amit ...
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
13 years 11 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
ICCAD
2010
IEEE
176views Hardware» more  ICCAD 2010»
13 years 3 months ago
An auction based pre-processing technique to determine detour in global routing
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
Yue Xu, Chris Chu
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
13 years 11 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden