4037 search results - page 147 / 808 » Routing without ordering |
DAC
2002
ACM
14 years 10 months ago
2002
ACM
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
PERCOM
2008
ACM
14 years 8 months ago
2008
ACM
One of the most evident characteristics of an ad hoc ubiquitous computing environment is the dynamism of connections. Due to the mobility of nodes, paths between communicating pee...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
CCECE
2009
IEEE
14 years 16 days ago
2009
IEEE
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
ASPDAC
2005
ACM
13 years 11 months ago
2005
ACM
Abstract— As VLSI technology enters the ultra-deep submicron era, wire coupling capacitance starts to dominate self capacitance and can no longer be neglected in timing driven ro...