Sciweavers

657 search results - page 66 / 132
» Parallel randomized load balancing
Sort
View
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 9 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
GRID
2004
Springer
14 years 2 months ago
Design and Analysis of a Dynamic Scheduling Strategy with Resource Estimation for Large-Scale Grid Systems
In this paper, we present a resource conscious dynamic scheduling strategy for handling large volume computationally intensive loads in a Grid system involving multiple sources an...
Sivakumar Viswanathan, Bharadwaj Veeravalli, Danto...
MSWIM
2006
ACM
14 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
JSAC
2008
98views more  JSAC 2008»
13 years 9 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
ICDE
2002
IEEE
116views Database» more  ICDE 2002»
14 years 10 months ago
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when e...
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Rog...