Sciweavers

801 search results - page 66 / 161
» Minimal Locked Trees
Sort
View
WCW
2004
Springer
15 years 11 months ago
FatNemo: Building a Resilient Multi-source Multicast Fat-Tree
This paper proposes the idea of emulating fat-trees in overlays for multi-source multicast applications. Fat-trees are like real trees in that their branches become thicker the clo...
Stefan Birrer, Dong Lu, Fabián E. Bustamant...
CONCUR
2006
Springer
15 years 8 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
ICCAD
2005
IEEE
95views Hardware» more  ICCAD 2005»
16 years 3 months ago
TACO: temperature aware clock-tree optimization
— In this paper, an efficient linear time algorithm TACO is proposed for the first time to minimize the worst case clock skew in the presence of on-chip thermal variation. TACO...
Minsik Cho, Suhail Ahmed, David Z. Pan
ISPDC
2006
IEEE
16 years 11 days ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
DAC
1989
ACM
15 years 10 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong