Abstract: According to one embodiment, a controller writes a first data associated with a write request and a first logical address specified by the write request to a first block. The controller updates a logical-to-physical address translation table such that a first physical address indicating a first storage location in the first block in which the first data is written is associated with the first logical address. In response to receiving an invalidation request for invalidating the first data corresponding to the first logical address, the controller acquires, from the logical-to-physical address translation table, the first physical address, and updates a valid data identifier corresponding to a storage location indicated by the first physical address to a value indicating invalidation.

Abstract: Embodiments of content management systems in which compression and decompression may be performed at the client in cases where the client device or application may be capable of such compression and decompression while still allowing compression to be performed at the content management system when client devices or applications are unable to perform such compression or decompression are disclosed.

Abstract: An exemplary semiconductor device includes an input/output (I/O) circuit configured to combine data corresponding to a write command received via data terminals with a first subset of corrected read data retrieved from a memory cell array to provide write data. The exemplary semiconductor device further includes a write driver circuit configured to mask a write operation of a first bit of the write data that corresponds to a bit of the first subset of the read data and to perform a write operation for a second bit of the write data that corresponds to the data received via the data terminals.

Abstract: A computer-implemented method includes refreshing a set of memory channels in a memory system substantially simultaneously, each memory channel refreshing a rank that is distinct from each of the other ranks being refreshed. Further, the method includes marking a memory channel from the set of memory channels as being unavailable for the rank being refreshed in the memory channel. In one or more examples, the method further includes blocking a fetch command to the memory channel for the rank being refreshed in the memory channel.

Abstract: Embodiments of content management systems in which compression and decompression may be performed at the client in cases where the client device or application may be capable of such compression and decompression while still allowing compression to be performed at the content management system when client devices or applications are unable to perform such compression or decompression are disclosed.

Abstract: A method and device for improving data storage security, related to the technical field of cloud storage is disclosed. The method includes: detecting access counts of user data sets in a cloud storage resource pool, where the user data sets in the cloud storage resource pool are data obtained by encoding with an erasure coding algorithm of a first security level; determining a first user data set whose access count in the cloud storage resource pool meets a preset condition; obtaining a second security level according to attribute information of the cloud storage resource pool, wherein the attribute information includes the first security level and an increment for security step; and re-encoding the first user data set with an erasure coding algorithm of the second security level to obtain re-encoded first user data sets.

Abstract: A memory controller and a method for accessing a memory module are provided. The memory controller is coupled between the memory module and a host controller to control the access of the host controller to the memory module. The memory controller comprises: a central buffer coupled to the host controller for receiving a data access command from the host controller, and coupled to the memory module for providing a modified data access command to the memory module; wherein the central buffer comprises an access command processing module, for processing the data access command to generate the modified data access command; and a data buffer coupled to the central buffer for receiving the modified data access command from the central buffer, and coupled between the host controller and the memory module for exchanging data between the host controller and the memory module under the control of the modified data access command.

Abstract: An improvement in erasure coded group management shared nothing storage clusters establishing an invariant which declares read-modify-writes will not be done by the system and implements a metadata distribution operation to provide fault tolerance.

Abstract: A system and method for supporting data protection across field programmable gate array (FPGA) solid state drives (SSDs) includes a storage system having a first group of solid state drives connected to a FPGA. The FPGA includes a first data protection controller configured to manage input/output requests to and from the first group of solid state disks according to a data protection configuration, generate parity bits according to the data protection configuration, and store the parity bits on at least parity solid state drive from the first group of solid state drives.

Abstract: Recovery of chunk segments stored via hierarchical erasure coding in a geographically diverse data storage system is disclosed. Chunks can be stored according to a first-level erasure coding scheme in zones of a geographically diverse data storage system. The chunks can then be further protected via one or more second-level erasure coding schema within a corresponding zone of the geographically diverse data storage system. In response to determining segment of a chunk has become less accessible, recover of the segment can be performed according to the hierarchical erasure coding scheme of relevant chunks at relevant zones of the geographically diverse data storage system.

Abstract: Systems, methods, and apparatuses for last branch record support are described. In an embodiment, a hardware processor core comprises a hardware execution unit to execute a branch instruction, at least two last branch record (LBR) registers to store a source and destination information of a branch taken during program execution, wherein an entry in a LBR register is to include an encoding of the branch, a write bit array to indicate which LBR register is architecturally correct, an architectural bit array to indicate when an LBR register has been written, and a plurality of top of stack pointers to indicate which LBR register in a LBR register stack is to be written.

Abstract: Systems, apparatus and methods for generation of XOR signature metadata and XOR signature management are presented. In one or more embodiments, a storage device controller includes a host interface, configured to receive one or more string lines (SLs) of data from a host, the one or more SLs to be programmed into a non-volatile memory (NVM), and processing circuitry. The processing circuitry is configured to, for each of the one or more SLs, generate signature metadata and provide the signature metadata in a header of the SL. The processing circuitry is still further configured to XOR two or more of the SLs with their respective signature metadata to generate a snapshot, and write the snapshot to the NVM.

Abstract: A method performed by a memory is described. The method includes sensing first bits from a first activated column associated with a first sub-word line structure simultaneously with the sensing of second bits from a second activated column associated with a second sub-word line structure. The method also includes providing the first bits at a same first bit location within different read words of a burst read sequence and providing the second bits at a same second bit location within the different read words of the burst read sequence.

Abstract: An error correction and fault, tolerance method and system for an array of disks is presented. The array comprises k+5 disks, where k disks store user data and 5 disks store computed parity. The present invention further comprises a method and a system for reconstituting the original content of each of the k+5 disks, when up to disks have been lost, wherein the number of disks at unknown locations is E and the number of disks wherein the location of the disks is known is Z. All combinations of faulty disks wherein Z+2×E?4 are reconstituted. Some combinations of faulty disks wherein Z+2×E?5 are either reconstituted, or errors are limited to a small list.

Abstract: Provided are a computer program product, system, and method for determining a storage pool in which to store a data object. Event messages are received. Each event message includes metadata on an object updated in a storage pool of a plurality of storage pools, at least two of the storage pools have different reliability ratings. The event messages are added to a message queue. Information is added to a database for the event messages in the message queue including the metadata in the event message. A determination is made of a data classification of a changed data object indicated in the database. The changed data object indicated in the database having the determined data classification is moved to a storage pool having a reliability rating satisfying a reliability rating associated with the data classification of the changed data object.

Abstract: Described herein, system that facilitates replication of data in a geographically distributed storage environment. According to an embodiment, a system can comprise storing a first data chunk at a first site of a first region in a geographically diverse data storage system, determining a second region in the geographically diverse data storage system for storage of a first copy of the first data chunk, wherein the first copy is stored at a second site located within the second region, and determining a third region in the geographically diverse data storage system for storage of a second copy of the first data chunk, wherein the second copy is stored at a third site located within the third region.

Abstract: An object is divided into SD1 first-level pieces. Each first-level piece is stored in a first-level container on a first-level storage entity. A redundant encoding of the first-level containers is stored in RL1 additional first-level containers on RL1 additional first-level storage entities. On each of the first-level storage entities, the locally-stored first-level container is divided into SD2 local second-level pieces. Each second-level piece is stored in a second-level container on a second-level storage entity of the specific first-level storage entity. Each first-level storage entities contains SD2 plus RL2 second-level storage entities. A redundant encoding of the second-level containers is stored in RL2 additional second-level containers on RL2 additional second-level storage entities.

Abstract: A storage device includes a controller and a nonvolatile memory device having memory cells and reference memory cells. The controller accesses first memory cells of the memory cells, reads first reference memory cells, which are associated with the first memory cells, from among the reference memory cells when the access to the first memory cells fails, determines a bad area depending on a read result of the first reference memory cells, and identifies second memory cells, which belong to the bad area, from among the memory cells to bad memory cells.

Abstract: A method and an apparatus for triggering RAID reconstruction are disclosed, to achieve high universality and usability in triggering RAID reconstruction. The method includes: obtaining valid data information of a target storage medium after a change in storage mediums in a RAID is detected (S101); and reconstructing the RAID if the valid data information satisfies a preset reconstruction condition (S102).

Abstract: A method, non-transitory computer readable medium, and device that assists with reducing initialization duration and performance impact during configuration of storage drives includes identifying a plurality of new storage drives in a storage system. Next, one or more zeroed out storage drives is identified from the identified plurality of new storage drives based on information present in a data portion of each the identified plurality of new storage drives. A volume group comprising the identified one or more zeroed out drives is created and this created volume group is provided for data operation.

Abstract: A method for repairing a single erasure in a Reed Solomon code in a system of a plurality of n storage nodes and a controller, wherein a content of each storage node is a codeword and each node stores a vector v. The method includes identifying a failed storage node; transmitting an index of the failed storage node to each surviving storage node; multiplying the content of each node i by a j-th component of a vector that is a permutation of elements of vector v that correspond to the surviving storage nodes; determining a trace map of the result and converting the result from an m×r bit representation into a reduced representation of r bits; reconstructing the content of the failed storage node from the reduced representation of each surviving node's content; and outputting the reconstructed content of the failed storage node.

Abstract: A method begins with one or more processing modules of a dispersed storage network (DSN) identifying a set of encoded data slices generated from a data segment based on an error encoding dispersal function. The method continues with the one or more processing modules identifying a set of storage units (SUs) that distributedly store the set of EDSs, and determining a first plurality of performance values associated with the set of SUs, followed by the one or more processing modules receiving from the set of SUs a second plurality of performance values generated by the set of SUs.

Abstract: A method for transferring a command from a host to a device controller and a system using the method are disclosed. The method includes the steps of: A. determining a segment size; B. dividing a command into a number of sections each having a size the same as the segment size; C. sequentially distributing the sections to n groups; D. changing distributing order to a reverse order or keeping the same distributing order in step C if a cycle of distribution is finished while there are sections left for distributing; E. restructuring the section(s) in each group as a sub-command after all sections are distributed; and F. providing the sub-commands to a device controller synchronously.

Abstract: One embodiment is related to a method for remote replication recovery, comprising: determining that a damaged data chunk at a first zone of a cloud storage system is not recoverable locally; determining one or more data fragments of the damaged data chunk that are to be recovered with remote replication recovery based on data stored at a second zone and at a third zone of the cloud storage system, wherein the damaged data chunk comprises a plurality of data fragments; recovering the one or more data fragments of the damaged data chunk with remote replication recovery based on the data stored at the second zone and at the third zone of the cloud storage system; and repairing the damaged data chunk with the recovered data fragments at the first zone.

Abstract: A method of operating a storage device includes receiving a first logical address from a host, determining whether first metadata stored in a volatile memory of the storage device and associated with the first logical address is corrupted, processing the first metadata as an uncorrectable error when the first metadata is determined to be corrupted, providing an error message to the host indicating that an operation cannot be performed on data associated with the first logical address when the first metadata is processed as the uncorrectable error, after the providing of the error message, receiving a second logical address from the host, determining whether second metadata stored in the volatile memory and associated with the second logical address is corrupted, and performing an operation of accessing the non-volatile memory based on the second metadata, when the second metadata is not determined to be corrupted.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes: generating an encoded data slice from a dispersed storage encoding of a data object and determining when the encoded data slice will not be stored in local dispersed storage. When the encoded data slice will not be stored in the local dispersed storage, the encoded data slice is stored via at least one elastic slice in an elastic dispersed storage, an elastic storage pointer is generated indicating a location of the elastic slice in the elastic dispersed storage, and the elastic storage pointer is stored in the local dispersed storage.

Abstract: A method for execution by processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by identifying a stored data object (using bundled writes) for retrieval from a dispersed storage network (DSN), determining a DSN address that corresponds to the store data object, generating a read source request based on the DSN address, identifying a set of storage units of the DSN, where one or more of the storage units of the set of storage units are associated with storage of the stored data object, sending the read source request to the identified set of storage units, receiving retrieved encoded data slices from at least some of the storage units of the identified set of storage units and dispersed storage error decoding, for each set of encoded data slices, a decode threshold of received encoded data slices to produce a recovered data object.

Abstract: A highly resilient, scalable, high-performance data storage system that stripes its content across peer computers in a data cluster, across data clusters in a cluster group, and across cluster groups in a multi-cluster-group Hyper Storage System. Multiple peers can fail within a data cluster, even beyond the FEC level configured in the cluster, without disrupting the clients. Multiple entire data clusters can fail or be taken out of service without disrupting the clients. Peer failures are detected by the cluster and all missing data is seamlessly regenerated through vertical and/or horizontal resiliency so the great majority of I/O operations complete successfully.

Abstract: A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. A computing device identifies data slices (EDSs) of pillar width (associated with data object) to be stored within a pillar width number of a plurality of storage units (SUs). The computing device the identifies head SUs among the pillar width number of the SUs such that, based on a ring arrangement, each set of EDSs is distributedly stored among the ring arrangement of the pillar width number of the SUs starting with its respective head EDS at a respective head SU and ending with a last tail EDS at a respective last tail SU.

Abstract: For self-healing in a hash-based deduplication system using a processor device in a computing environment, deduplication digests of data and a corresponding list of the deduplication digests in a table of contents (TOC) are maintained for the self-healing of data that is lost or unreadable. The input data digests are compared to the TOC if directed to data that is lost or unreadable, and the input data digests are used to repair the one of lost and unreadable data.

Abstract: An information processing apparatus can prevent performance deterioration, and maintain fault tolerance, in a storage system having storage nodes of different capacities. The apparatus includes a data writing unit to divide received data into divided data, generate a parity data usable when re-configuring the received data having an error, and write divided data and parity data in storage nodes. The apparatus includes a relocation unit to assign a relocation position of the data based on a predetermined condition and store the data in the assigned storage nodes. The apparatus includes a data reading unit to read the divided data so as not to read parity data stored in the storage nodes by identifying the parity data.

Abstract: An operating method of a storage device includes simultaneously buffering first data in a first nonvolatile memory device and a second nonvolatile memory device, simultaneously buffering second data in the second nonvolatile memory device and a third nonvolatile memory device, performing a parity operation on the first data and the second data in the second nonvolatile memory device to generate a parity, and programming the first data, the second data, and the parity into the first nonvolatile memory device, the third nonvolatile memory device, and the second nonvolatile memory device, respectively.

Abstract: An application executed on a device reads a portion of a memory during one of an initialization operation and a regular read operation. The application may trigger a preventative read operation during at least one regular read operation. During the preventative read operation the application selects at least one block and at least one page for the preventative read operation. The application determines a cadence for the preventative read operation. The application obtains an error correction code (ECC) status for the portion of the memory, determines if a number of errors associated with the portion is greater than a predefined ECC threshold and performs a correction, responsive to determining that a number of errors associated with the portion is greater than a predefined ECC threshold.

Abstract: A parity-layout generating method, includes: creating a first local parity layout with a first calculation range for calculating local parity; creating a second local parity layout with a second calculation range for calculating local parity, a length of the second calculation range being different from a length of the first calculation range; and creating, by a computer, a third local parity layout with the first calculation range and the second calculation range by combining the first local parity layout and the second local parity layout.

Abstract: A data recovery method, a data recovery device and a distributed storage system are provided, where the method includes: in a case that a distributed storage system loses data of three nodes, recovering data on a target data storage node of the data on the three nodes according to data of a parity node and a data storage node without data loss; and performing degraded recovery on the remaining lost data according to the recovered data of the target data storage node. According to the embodiments of the present invention, a target data storage node first recovered is determined according to the symmetry of lost data, and the lost data of three nodes is recovered according to parity data and data that is not lost, which can improve the data recovery performance of the distributed storage system in a case that the data of three nodes is lost.

Abstract: A method for disk failure protection, the method may include calculating a first set of parity units by processing a first group of sets of data units that are cached in a cache memory of a storage system; calculating a second set of parity units by processing the first group of sets of data units; wherein the calculating of the second set of parity units is responsive to a first shift that was virtually introduced between each set of data units of the first group of sets of data units; and destaging the first group of sets of data units and the first and second sets of parity units to the first group of disks.

Abstract: A method for dynamically balancing the allocation of data among a plurality of physical data storage devices having a plurality of RAID devices defined thereon, wherein at least one of the plurality of RAID devices is comprised of at least one of a different type of physical storage device or a different number of physical data storage devices than at least one other of the plurality of RAID devices, includes determining a usage factor unique to each RAID device and balancing data I/O based at least in part on the usage factor.

Abstract: An exemplary method is implemented by a radio frequency receiver for synchronizing the recovery of data carried by frames. An indication is generated from error correction of whether the error control coding in the receiver is capable of correcting all the errors induced by the channel within the frame. If the indication declares that all the errors are corrected, then the carrier frequency estimate associated with the error free frame is saved in memory and will be used to initialize the carrier recovery loop at the beginning of the following frames until such frequency estimate is declared unreliable. A new carrier frequency estimate is available at the end of each frame, and if such estimate is proven to be reliable for future use, the current estimate in memory will be overwritten by the new estimate and the freshness of the frequency estimate is extended.

Abstract: A method, system and memory controller are provided for implementing simultaneous read and write operations in a memory subsystem utilizing a dual port Dynamic Random Access Memory (DRAM) configuration. A DRAM includes a first partition and a second partition. A memory controller determines if memory requirements are above or below a usage threshold. If the memory requirements are below the usage threshold, the memory is partitioned into a read buffer and a write buffer, with writes going to the write buffer and reads coming from the read buffer, data being transferred from the write buffer to the read buffer through an Error Correction Code (ECC) engine. If the memory requirements are above the usage threshold, the entire memory is used for reads and writes.

Abstract: Decoding associated with a second error correction code and a first error correction code is performed. Ns first and second-corrected segments of data, first sets of parity information, and second sets of parity information are intersegment interleaved to obtain intersegment interleaved data, where the Ns segments of data, the Ns first sets of parity information, and the Ns second sets of parity information have had decoding associated with the first and the second error correction code performed on them (Ns is the number of segments interleaved together). Decoding associated with a third error correction code is performed on the intersegment interleaved data and interleaved parity information to obtain at least third-corrected interleaved data. The third-corrected interleaved data is de-interleaved.

Abstract: An apparatus includes a memory and a controller. The memory includes a plurality of memory devices. Each memory device has a plurality of page types. The plurality of page types are classified based on error rate variations. The controller may be configured to write user data and error-correction data to the memory. The user data and the error-correction data are organized as a super-page. The super-page includes a plurality of sub-pages. The plurality of sub-pages are written across the plurality of memory devices such that the plurality of sub-pages are stored using more than one of the plurality of page types.

Abstract: The storage apparatus has a control unit that includes: an identification unit that is configured to determine that a first data element contained in the data is incorrect, when a first restoration calculation first data element, which is restored from the first data element using other data elements of the data excluding the first data element and a new redundancy code obtained from the data by a first calculation method, coincides with a second restoration calculation first data element, which is restored from the first data element using the other data elements and a new redundancy code obtained from the data by a second calculation method; and a restoration unit that is configured to correct the first data element in the storage devices that is determined to be incorrect by the identification unit, to either the first restoration calculation first data element or the second restoration calculation first data element.

Abstract: A method and apparatus uses a flexible buffering scheme in an XOR engine to generate checksums, allowing a user to recover data when a disk drive partly or completely fails. An XOR engine may include three or more arithmetic units and three or more local result buffers, which may be used to generate a combination of any of a “P” checksum, a “Q” checksum, and an unmodified copy of the user data, in a single read. The local result buffers and arithmetic units allow the use of multiple Galois field Multiply coefficients so that multiple distinct “Q” checksums may be generated with only one read of the user data.

Abstract: Data storage devices are described with an ECC system that generate additional on-demand ECC information for a previously written track to provide for correction of data errors in the track and thereby avoid having to rewrite the track. Embodiments of the invention address the squeeze-error problem that arises when writing the next (second) track in a sequence causes errors to be introduced in the adjacent previously written (first) track. In alternative embodiments the existence of the data errors in the first track can be detected by reading the track or by estimating the number of likely errors using head position data measured while writing the first and second tracks. The additional on-demand ECC information can be written on any track that is available.

Abstract: A region of memory is logically divided into a number of segments, each of which is logically divided into a number of blocks. Blocks are allocated sequentially. A head pointer and a tail pointer demarcate the section of allocated blocks. As allocated blocks are added, the tail pointer is moved so that it remains at the end of the section of allocated blocks. If the tail pointer is within a threshold distance of the head pointer, then the head pointer is moved from its current position to a new position, and the allocated blocks between the current and new positions are freed (deallocated and/or erased). Thus, writes to the memory can be performed sequentially, and blocks can be freed in advance of when they are actually needed.

Abstract: A method begins by a processing module receiving a large data file for storage in a dispersed storage network (DSN) and determining initial dispersed storage error encoding parameters. The method continues with the processing module encoding, during a first time interval of receiving the large data file, first data segments of the large data file using the initial dispersed storage error encoding parameters to produce a first plurality of sets of encoded data slices. The method continues with the processing module writing the first plurality of sets of encoded data slices to the DSN and monitoring processing of the writing to produce first write processing performance information. When the first write processing performance information compares unfavorably to a desired write performance range, the method continues with the processing module adjusting, for a second time interval, the initial dispersed storage error encoding parameters to produce adjusted dispersed storage error encoding parameters.

Abstract: An information processing system includes a first information processing apparatus coupled to a first magnetic-disk-device groups including first magnetic disk devices whose motors rotate, a second information processing apparatus coupled to a second magnetic-disk-device group including one or more second magnetic disk devices whose motors rotate and a plurality of third magnetic disk devices whose motors are in a stop state. A management apparatus which included in the system is configured to manage the first and second information processing apparatuses, wherein, when data is to be written, the management apparatus outputs a write request to any of the plurality of first magnetic disk devices and any of the one or more second magnetic disk devices, and when data is to be read, the management apparatus outputs a read request to any of the plurality of first magnetic disk devices.

Abstract: In one embodiment, a node is a member of a cluster having a plurality of nodes, where each node is coupled to one or more storage arrays of solid state drives (SSDs) that serve as main storage. The node executed a storage input/output (I/O) stack having a redundant array of independent disks (RAID) layer that organizes the SSDs within the one or more storage arrays as one or more RAID groups. Configuration information is stored as a cluster database. The configuration information identifies (i) one or more RAID groups associated with an extent store, (ii) SSDs within each RAID group, and (iii) an identification of a node that owns the extent store. The cluster database is stored separate and apart from the main storage.

Abstract: The method delivers a storage system for Big Data usage. The system contains a matrix of unreliable physical data devices and data in this reliable big capacity storage system is protected by the triple protection so the method and system can protect storage system from more than 2 fault data devices. In some cases, the system can still deliver data when system has many failed data devices at the same. Floating Parity technology can also avoid heavily writing data to some device surfaces, due to parity update, which cause data device to be failed before expected device life time.