Uniform generation of random regular graphs of moderate degree
Journal of Algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Extending Heterogeneity to RAID Level 5
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Synthesis of Interconnection Networks: A Novel Approach
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Generating Random Regular Graphs Quickly
Combinatorics, Probability and Computing
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing
Tunable randomization for load management in shared-disk clusters
ACM Transactions on Storage (TOS)
A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Handling Heterogeneity in Shared-Disk File Systems
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
An Efficient Data Location Protocol for Self.organizing Storage Clusters
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Weighted distributed hash tables
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A case for virtualized arrays of RAID
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Data replication in p2p environments
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Online Balancing Two Independent Criteria
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Redundant Data Placement Strategies for Cluster Storage Environments
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Online Scheduling with Bounded Migration
Mathematics of Operations Research
MHS: A distributed metadata management strategy
Journal of Systems and Software
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
RSEDP: an effective hybrid data placement algorithm for large-scale storage systems
The Journal of Supercomputing
SkewCCC+: a heterogeneous distributed hash table
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Improving the data placement algorithm of randomization in SAN
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
RDIM: a self-adaptive and balanced distribution for replicated data in scalable storage clusters
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Design and implementation of a SAN agent for windows NT architecture
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Content distribution in heterogenous video-on-demand p2p networks with ARIMA forecasts
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Direct lookup and hash-based metadata placement for local file systems
Proceedings of the 6th International Systems and Storage Conference
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper we study the problem of designing compact, adaptive strategies for the distribution of objects among a heterogeneous set of servers. Ideally, such a strategy should allow the computation of the position of an object with a low time and space complexity, and it should be able to adapt with a near-minimum amount of replacements of objects to changes in the capabilities of the servers so that objects are always distributed among the servers according to their capabilities. Previous techniques are able to handle these requirements only in part. For example, standard hashing techniques can be used to achieve a non-uniform distribution of objects among a set of servers and the time and space efficient computation of the position of the objects, but they usually do not adapt well to a change in the capabilities. We present two strategies based on hashing that achieve all of the goals above. Furthermore, we give a list of applications for these strategies demonstrating that they can be used efficiently for distributed data management, web caches, and adaptive random graphs, which may be of interest for peer-to-peer networks.