In a computer system that includes a set of cross repositories for data storage, a document is broken into portions, and each portion is stored in at least one repository (and preferably many or all of the cross repositories). In this way, when a portion of the document requires an update, the communication of updated data can be limited to the relevant portion(s) of the document. Also, if a user requires only certain portion(s) of the saved document, then the data transfer from a cross repository to the user can be limited to those certain portion(s) of the document.

A hybrid addressing scheme in which a maximum of three codeword groups are utilized across pairs of memory dice and/or access rows of the memory sub-system or memory device is provided. By controlling the arrangement of such codewords, it can be possible to group codewords such that disturb effects can be reduced. For example, codewords can be grouped in a symmetrical manner with respect to the memory dice of a memory device, which can allow for simplified codeword addressing.

A non-transitory computer readable medium stores instructions that, when executed by a processor, cause the processor to receive, via the processor, a command to perform a memory purge; retrieve, from non-volatile memory, via the processor, code of a purging firmware package; store, in volatile memory, via the processor, the code; execute, via the processor, the code from the volatile memory, thereby causing the processor to purge the non-volatile memory; and cycle power to the industrial automation component, wherein cycling the power comprises purging the volatile memory.

According to one embodiment, a memory system includes a storage device and a controller. The controller is configured to control data write to the storage device and data read from the storage device based on a request from a host device. The controller is configured to maintain or invert logic of first data that is part of transmit data to be transferred to the storage device by N bits per 1 unit interval (UI) through N data signal lines (N is a natural number of one or more), create second data indicating presence or absence of inversion of the logic of the first data, and transfer the first data and the second data to the storage device through the N data signal lines.

Example implementations relate to virtual persistent volumes for containerized applications. In an example, a plurality of different storage mounts are acquired from a mix of storage types. A containerized storage virtualization system creates and manages a virtual persistent volume that aggregates the acquired storage mounts. A mount point of the virtual persistent volume is provided to the containerized application. The virtual persistent volume includes a hierarchical structure that relates data objects of the containerized application by content-based signatures to a root object.

At least one processing device receives a create-token command from a host device. Responsive to receipt of the create-token command, the processing device creates the token, generates an in-memory snapshot of data in one or more logical address ranges of one or more source storage volumes, associates the in-memory snapshot with the token, and provides the token to the host device. The processing device receives a write-via token command from the host device, the write-via-token command specifying the token and one or more logical address ranges of one or more target storage volumes. Responsive to receipt of the write-via-token command, the processing device determines whether or not differential metadata of the storage system includes one or more entries for the one or more logical address ranges of the one or more source storage volumes, and controls execution of the write-via-token command based at least in part on the determination.

A uniform model for distinct types of data replication, including receiving, at a source data repository, an update to a dataset; generating, based on the update to the dataset, both metadata describing the update to the dataset and also a metadata representation of the dataset; and initiating, based on the same metadata describing the update to the dataset and also based on the same metadata representation of the dataset, either a first type of data replication or a second type of data replication from among a plurality of types of data replication.

A method for generating a reconstructed version of a filesystem entity, the method may include (i) generating fallback retrieval metadata for a reconstructed version segment, when the reconstructed version segment is (a) associated with a corresponding intermediate version segment, and (b) the corresponding intermediate version segment is preceded by a corresponding most updated segment that does not exceed a fallback version of the filesystem entity; wherein the reconstructed version segment, the corresponding intermediate version segment and the corresponding most updated segment that does not exceed a fallback version have a same address range; (ii) generating a non-existing indicator for the reconstructed version segment, when the reconstructed version segment is (a) associated with the corresponding intermediate version segment, and (b) the corresponding intermediate version segment is not preceded by any corresponding most updated segment that does not exceed the fallback version; and (iii) maintaining intermediate metadata for retrieving one or more intermediate versions of the filesystem entity.

Rotating disk drives can be partitioned into performance partitions (PPs) each including slices having similar performance in accordance with an allowable difference or tolerance for any of data throughput, bandwidth and data transfer rate. Each subdrive can correspond to slices of the rotating disk drives included in a single PP. Each PP can have a performance level denoting a relative performance ranking of PPs. Each PP tier can include PPs across multiple rotating disk drives have the same performance level. Resiliency sets (RSs) can be configured from the PP tiers where each RS can include slices of subdrives from only one of the PP tiers. Physical ubers or units (PUs) can be allocated from the RSs. Each PU can denote a mapped RAID group configured from slices of different subdrives of one RS. Spare slices can be reserved in each RS or a lowest performance PP tier.

A method includes determining a storage modification process for a set of encoded data slices based on a change to the storage parameters associated with storage of data objects in a storage network, where a data segment of the data objects is dispersed storage error encoded into the set of encoded data slices in accordance with dispersed storage error encoding parameters, and where the set of encoded data slices is stored in the storage network. The method also includes executing the storage modification process such that the set of encoded data slices are stored in the storage network in accordance with the changed storage parameters.