![]() ![]() The init command first connects to the storage specified by the storage URL. erasure-coding : enable erasure coding to protect against storage corruption repository initialize a new repository at the specified path rather than the current working directory key the RSA public key to encrypt file chunks storage-name assign a name to the storage duplicacy directory (absolute or relative to current directory) iterations the number of iterations used in storage key derivation (default is 16384) min-chunk-size, -min the minimum size of chunks (default is chunk-size/4) max-chunk-size, -max the maximum size of chunks (default is chunk-size*4) chunk-size, -c the average size of chunks (default is 4M) encrypt, -e encrypt the storage with a password Due to the overhead of managing the number of fragments associated with an erasure coded copy, do not use Erasure Coding profiles for objects smaller than one megabyte.Duplicacy init - Initialize the storage if necessary and the current directory as the repository A large object that is erasure coded and distributed across sites will take longer to retrieve than an object that is replicated and available locally (the same site to which the client connects). ![]() At the same time, to protect replicated object data from a site loss, a StorageGRID Webscale deployment requires a minimum of two sites.ĭepending on the configuration of storage pools, it may take longer to retrieve an erasure coded copy than a replicated copy. For example, if using an erasure coding scheme of 6+3, to protect erasure coded object data from a site loss, a StorageGRID Webscale deployment must include a minimum of three sites. ![]() However, a StorageGRID Webscale deployment that creates erasure coded copies may initially require more Storage Nodes than a deployment that will create replicated copies and may also require more sites. For example, a 10 MB object that is replicated once consumes 20 MB of disk space, while an object that is erasure coded with a 6+3 scheme only consumes 15 MB of disk space. Object data protected from loss through erasure coding consumes less disk space than if it is protected through replication. However, if the erasure coding scheme’s fault tolerance is breached (four in the case of a 6+3 erasure coding scheme), the object is considered lost and cannot be retrieved. This is the erasure coding scheme’s fault tolerance. Any three fragments (data or parity) can be lost and object data is still recoverable. ![]() The following is an example of a 6+3 erasure coding scheme, detailing the number of fragments that object data is broken into and the maximum number of fragments that can be lost without impacting the ability to recover an object depends on the erasure coding scheme used. For example, in a 6+3 erasure coding scheme, each part of object data is encoded into six data fragments and three parity fragments and a maximum of three fragments can be lost. An erasure code's parameters are the number of data and parity fragments generated for each part of an erasure coded object. For example, an erasure coding scheme of 6+3 creates six data fragments and three parity fragments distributed across nine Storage Nodes.Īn erasure coding scheme is defined by the erasure code's parameters and determines the maximum number of fragments that can be lost while maintaining the ability to retrieve the object. These data and parity fragments are distributed amongst the associated storage pool's Storage Nodes. The number of data and parity fragments that object data is broken into depends on the erasure coding scheme selected for the Erasure Coding profile. A data fragment is a portion of the object’s data, while a parity fragment contains the information required to reconstruct object data if data fragments are lost. If fragments are lost, object data can still be recovered through the information encoded in the remaining fragments. You then select this storage pool and its associated Erasure Coding profile when configuring an ILM rule’s Content Placement instructions to create an erasure coded copy whose fragments are distributed amongst the selected storage pool’s Storage Nodes.Įrasure coding protects object data from loss by breaking it into data and parity fragments. An Erasure Coding profile allows you to associate a storage pool with an erasure coding scheme. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |