Concept and Evaluation of X-NAS: A Highly Scalable NAS System
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Reliability Mechanisms for Very Large Storage Systems
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Research and implementation of management software for SAN based on clustering technology
VRCAI '04 Proceedings of the 2004 ACM SIGGRAPH international conference on Virtual Reality continuum and its applications in industry
A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
An Efficient Data Location Protocol for Self.organizing Storage Clusters
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
A case for virtualized arrays of RAID
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
Increasing the capacity of RAID5 by online gradual assimilation
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Optimization of the Switches in Storage Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Adaptive data block placement based on deterministic zones (adaptiveZ)
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Proceedings of the 1st ACM symposium on Cloud computing
RSEDP: an effective hybrid data placement algorithm for large-scale storage systems
The Journal of Supercomputing
FastScale: accelerate RAID scaling by minimizing data migration
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
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
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Design and Evaluation of a New Approach to RAID-0 Scaling
ACM Transactions on Storage (TOS)
| Hi-index | 0.01 |
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as a system as it grows from a few disks to hundreds or thousands. A client using our algorithm can locate a data object in microseconds without consulting a central server or maintaining a full mapping of objects or buckets to disks. Despite requiring little global configuration data, ouralgorithm is probabilistically optimal in both distributing data evenly and minimizing data movement when new storage is added to the system. Moreover, our algorithm supports weighted allocation and variable levels of object replication, both of which are needed to permit systems to efficiently grow while accommodating new technology.