Abstract: A computer-implemented method comprising: maintaining a tree of an active volume and a tree for each of a plurality of points in time (PiTs) of the volume; wherein each of the trees includes a plurality of map blocks and a plurality of data blocks; wherein each map block references blocks by media pointers; locating a data object that belongs to a snapshot associated with particular PiT of the plurality of PiTs, by: traversing the tree for the particular PiT, starting from a top block of tree for the particular PiT, by using the media pointers, until a map entry in one of the plurality of map blocks in the tree for the particular PiT includes a first indicator or a second indictor; wherein the first indicator indicates that the data object is located; wherein the second indictor indicates an implicit sharing of the data object.

Abstract: A computer-implemented method comprises receiving, at a management container, an indication of a first set of service level objectives for a storage volume; based on the indication, the management container creating the storage volume, wherein the creating the storage volume includes dynamically selecting one or more storage devices from a plurality of storage devices and dynamically allocating, for each respective storage device of the one or more selected storage devices, a number of parcels at the respective storage device to use for the storage volume; in response to data being written to the storage volume, determining, by one or more service containers associated with the one or more selected storage devices, a particular parcel of the allocated parcels to write data to; and writing, by a particular service container of the one or more service containers that is associated with the particular parcel, an encrypted version of the data to the particular parcel.

Abstract: A method for calculating parity values including calculating a first set of parity values using datum stored in RAID Grid locations in a first PCB, where datum associated with the RAID Grid locations in the first PCB is obtained in a first order that is based on a Hilbert curve. The method further includes calculating a second set of parity values using datum stored in RAID Grid locations in a second PCB, where datum associated with the RAID Grid locations in the second PCB is obtained in a second order that is based on the Hilbert curve. The method further includes storing at least a portion of the first set of parity values and a second set of parity values in a cache, memory, or persistent storage, where each of the first parity values and second parity values is associated with a separate RAID Grid location in the RAID Grid.

Abstract: A method for calculating parity values including calculating a first set of parity values using datum stored in RAID Grid locations in a first PCB, where datum associated with the RAID Grid locations in the first PCB is obtained in a first order that is based on a Hilbert curve. The method further includes calculating a second set of parity values using datum stored in RAID Grid locations in a second PCB, where datum associated with the RAID Grid locations in the second PCB is obtained in a second order that is based on the Hilbert curve. The method further includes storing at least a portion of the first set of parity values and a second set of parity values in a cache, memory, or persistent storage, where each of the first parity values and second parity values is associated with a separate RAID Grid location in the RAID Grid.