Patent classifications
G06F2201/82
Techniques for preserving clone relationships between files
The described embodiments set forth techniques for preserving clone relationships between files at a computing device. In particular, the techniques involve identifying clone relationships between files in conjunction with performing operations on the files where it can be beneficial to preserve the clone relationships. The operations can include, for example, preserving clone relationships between files that are being copied from a source storage device (that supports file cloning) to a destination storage device that supports file cloning. Additionally, the operations can include preserving clone relationships when backing up and restoring files between a source storage device (that supports file cloning) and a destination storage device that does not support file cloning. In this manner, the various benefits afforded by the clone relationships between files can be retained even as the files are propagated to destination storage devices that may or may not support file cloning.
Method of verifying access of multi-core interconnect to level-2 cache
The present disclosure provides a method and a system of verifying access by a multi-core interconnect to an L2 cache in order to solve problems of delays and difficulties in locating errors and generating check expectation results. A consistency transmission monitoring circuitry detects, in real time, interactions among a multi-core interconnects system, all single-core processors, an L2 cache and a primary memory, and sends collected transmission information to an L2 cache expectation generator and a check circuitry. The L2 cache expectation generator obtains information from a global memory precise control circuitry according to a multi-core consistency protocol and generates an expected result. The check circuitry is responsible for comparing the expected result with an actual result, thus implementing determination of multi-core interconnect's access accuracy to the L2 cache without delay.
Dynamic triggering of block-level backups based on block change thresholds and corresponding file identities
A data storage management approach is disclosed that performs backup operations flexibly, based on a dynamic scheme of monitoring block changes occurring in production data. The illustrative system monitors block changes based on certain block-change thresholds and triggers block-level backups of the changed blocks when a threshold is passed. Block changes may be monitored in reference to particular files based on a reverse lookup mechanism. The illustrative system also collects and stores historical information on block changes, which may be used for reporting and predictive analysis.
Relaying storage operation requests to storage systems using underlying volume identifiers
Example implementations relate to virtual persistent volumes. In an example, a storage operation request includes a volume identifier. A volume mapping that corresponds to the volume identifier is identified. Underlying volume identifiers are identified based on the volume mapping. The underlying volume identifiers relate to underlying storage volumes that form at least part of a virtual persistent volume associated with the volume identifier. The storage operation request is relayed, using the underlying volume identifiers, to storage systems on which the underlying storage volumes are respectively located.
SYSTEMS AND METHODS FOR USING PATTERN-BASED BIT FLIPS FOR FASTER WRITE AND CONSISTENT ERROR RECOVERY
An information handling system may include a processor and a non-transitory computer-readable medium having stored thereon a program of instructions executable by the processor, the program of instructions configured to, when read and executed by the processor, receive a write request to a non-volatile memory, combine write request data and data patterns associated with the write request into a versioned log and store the versioned log in a persistent memory, and store in the persistent memory patterned-matched bits for single- and multi-bit error recovery code-based recovery.
Metadata control in a load-balanced distributed storage system
A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient address spaces are distributed across the plurality of storage devices such that each of the plurality of failure resilient address spaces spans a plurality of the storage devices. The plurality of computing devices maintains metadata that maps each failure resilient address space to one of the plurality of computing devices. The metadata is grouped into buckets. Each bucket is stored in a group of computing devices. However, only the leader of the group is able to directly access a particular bucket at any given time.
Reducing service disruptions in a micro-service environment
Aspects of the disclosure provide for reducing service disruptions in a computer system. A method of the disclosure may include identifying a plurality of services running on a node of a computer system, determining a plurality of priorities corresponding to the plurality of services, determining a plurality of service capacity factors for the plurality of services in view of the plurality of priorities, and determining a lost impact factor in view of the plurality of service capacity factors.
Automation and optimization of data recovery after a ransomware attack
In the face of ransomware attacks, which can be increasingly difficult to effectively prevent, a solution can be considered to be the minimization of the cost and time taken to recover data and, hence business activities. Embodiments perform a restore operation that include automatically identifying the most recent healthy backup, from which data should be restored, and the prioritizing of the order in which data should be restored.
Peer node recovery via approximate hash verification
An example operation may include one or more of receiving, from a blockchain peer node, a sequence of blocks stored in a hash-linked chain of blocks on a distributed ledger, where each block in the sequence of blocks includes a reduced-step hash of block content from a previous block in the sequence, performing an approximate hash verification on the reduced-step hashes stored among the sequence of blocks, and determining whether the sequence of blocks has been tampered with based on the approximate hash verification on the reduced-step hashes.
Controller for managing superblocks and operation method thereof
A method for operating a controller that controls a memory device includes: replacing a bad block of a superblock with a replacement block to form a reproduced superblock; controlling the memory device to perform a program operation on the reproduced superblock according to an interleaving scheme; moving data stored in the replacement block to a pseudo-replacement block when the program operation on the reproduced superblock is completed; and releasing the replacement block from the reproduced superblock.