Sciweavers

1017 search results - page 3 / 204
» Throughput-centric routing algorithm design
Sort
View
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 2 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
ASPDAC
2004
ACM
149views Hardware» more  ASPDAC 2004»
14 years 26 days ago
A coupling and crosstalk considered timing-driven global routing algorithm for high performance circuit design
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...
Jingyu Xu, Xianlong Hong, Tong Jing, Ling Zhang, J...
ITNG
2007
IEEE
14 years 1 months ago
On Design and Analysis of a Feasible Network-on-Chip (NoC) Architecture
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
Jun Ho Bahn, Seung Eun Lee, Nader Bagherzadeh
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
13 years 11 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
EVOW
2005
Springer
14 years 29 days ago
A Performance Evaluation Framework for Nature Inspired Routing Algorithms
Performance evaluation of routing protocols is an important area of research that deals with the analysis and investigation of such protocols. A performance evaluation framework un...
Horst Wedde, Muddassar Farooq