343 search results - page 3 / 69 » Estimating routing congestion using probabilistic analysis |
DAC
2009
ACM
14 years 21 hour ago
2009
ACM
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...
ISPD
2000
ACM
13 years 11 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
—This paper presents an efficient technique for the estimation of the routed wirelength during global placement using the wire density of the net. The proposed method identifie...
NOMS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
CCR
2004
13 years 7 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...