Reliable, Scalable, And High­ Performance Distributed Storage: Data Distribution

When used in place of conventional allocation tables, the algorithm efficiently addresses a range of critical storage-related placement issues, including statistically uniform data distribution, correlated failure and data safety, and data migration in dynamically changing storage clusters. Specifically, the algorithm places sets of data objects (either object replicas, or parity or erasure coded fragments) in a hierarchy of storage devices using a flexible rule language. The flexible hierarchical cluster description facilitates an adjustable balance between extremely efficient placement calculations and mapping stability when devices are added or removed from the cluster. It further provides the ability to enforce the separation of replicas across user-defined failure domains, limiting exposure to data loss due to correlated failures.

Publication Date
19 February 2014

file systems distributed storage systems hierarchical data distribution


Click here to download link on

Click to share this page via your favorite social network.

Learn more about defensive publications with our examples and frequently asked questions

What we are trying to do?

We are attempting to mobilize the creativity and innovative capacities of the Linux and broader open source community to codify the universe of preexisting inventions in defensive publications that upon publication in the IP.COM database will immediately serve as effective prior art that prevents anyone from having a patent issued that claims inventions that have already been document in a defensive publication. In addition to creating a vehicle to utilize this highly effective form of IP rights management for known inventions, it is hoped that the community will use defensive publications as a means of codifying future inventions should the inventors prefer not to make their invention the subject of a patent disclosure and application.