1017 search results - page 41 / 204 » A routing algorithm for flip-chip design |
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
Most research in the area of publish/subscribe systems has not considered fault-tolerance as a central design issues. However, faults do obviously occur and masking all faults is a...
CONEXT
2006
ACM
14 years 2 months ago
2006
ACM
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
DAC
2012
ACM
11 years 11 months ago
2012
ACM
We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the origin...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
HOTOS
2003
IEEE
14 years 2 months ago
2003
IEEE
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...