625 search results - page 11 / 125 » Routing in Trees |
ASPDAC
2005
ACM
14 years 12 months ago
2005
ACM
As the minimum feature sizes of VLSI circuits get smaller while the clock frequency increases, the effects of process variations become significant. We propose a UST/DME based ap...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
IPTPS
2005
Springer
15 years 3 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...