Sciweavers

1503 search results - page 85 / 301
» Self-optimizing distributed trees
Sort
View
SKG
2006
IEEE
14 years 4 months ago
Hierarchical Multicast Tree Algorithms of Data Grid
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
Weijia Jia, Qingfeng Fan, Qiongli Wu, Yanxiang He
IPPS
1994
IEEE
14 years 2 months ago
AVL Trees with Relaxed Balance
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
Kim S. Larsen
SPAA
1993
ACM
14 years 2 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout
APPROX
2007
Springer
87views Algorithms» more  APPROX 2007»
14 years 1 months ago
Stochastic Steiner Tree with Non-uniform Inflation
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
IPPS
2010
IEEE
13 years 7 months ago
Meta-scheduling in advance using red-black trees in heterogeneous Grids
Abstract--The provision of Quality of Service in Grid environments is still an open issue that needs attention from the research community. One way of contributing to the provision...
Luis Tomás, Carmen Carrión, Blanca C...