Sciweavers

625 search results - page 76 / 125
» Semi-preemptive routing on trees
Sort
View
ICDCS
2005
IEEE
14 years 3 months ago
Resilient Capacity-Aware Multicast Based on Overlay Networks
The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust inter-domain multicast rout...
Zhan Zhang, Shigang Chen, Yibei Ling, Randy Chow
IPPS
2003
IEEE
14 years 3 months ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
ISPD
2004
ACM
146views Hardware» more  ISPD 2004»
14 years 3 months ago
Power-aware clock tree planning
Modern processors and SoCs require the adoption of poweroriented design styles, due to the implications that power consumption may have on reliability, cost and manufacturability ...
Monica Donno, Enrico Macii, Luca Mazzoni
ISVLSI
2007
IEEE
184views VLSI» more  ISVLSI 2007»
14 years 4 months ago
Activity-Aware Registers Placement for Low Power Gated Clock Tree Construction
As power consumption of the clock tree dominates over 40% of the total power in modern high performance VLSI designs, measures must be taken to keep it under control. One of the m...
Weixiang Shen, Yici Cai, Xianlong Hong, Jiang Hu
SPAA
1996
ACM
14 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher