Abstract: A method for use in a first storage array, comprising: detecting whether a second storage array has designated the first storage array as a locally-preferred storage array, the detecting being performed when a first link between the second storage array and a witness node is down; setting a value of a first configuration setting to indicate that the first storage array is designated as a system-preferred storage array, the value of the first configuration setting being stored in a memory of the first storage array, the value of the first configuration setting being set only when the second storage array has designated the first storage array as a locally-preferred storage array; detecting, by the first storage array; and when the second link is down, assuming one of an active role or a passive role based, at least in part, on the value of the first configuration setting.

Abstract: The present disclosure generally relates to data storage devices and related methods that use secure host memory buffers (HMBs) and low latency operations. A controller of the data storage device is configured to access the HMB, where the HMB stores a Merkle Tree. When the HMB is initialized, the controller determines a number of hash levels of the Merkle Tree. Each hash level of the Merkle Tree comprises one or more hashes. When storing location data in a target data block of the Merkle Tree, the controller is configured to initialize only the hashes along a path between a top hash and the target data block. Each hash along the path has a non-initialized hash coupled to a common hash. The non-initialized hash is programmed with a non-initialized bit, such that only the relevant hashes and data blocks are initialized.

Abstract: Disclosed herein are systems and methods for enabling self-notarization in a data backup. In one aspects, a method may comprise generating the data backup at a computing device. The method may comprise calculating a checksum of the data backup. The method may comprise adding a self-notarization script to the data backup. The self-notarization script may be configured to automatically trigger without intervention by an external notarization system, in response to a pre-determined backup storage event, and in response to triggering, notarize and send the checksum to a distributed registry. The method may comprise sending the data backup comprising the self-notarization script to a backup storage device.

Abstract: A method includes: determining an amount of available storage in a user mobile device; predicting an amount of storage in the device that will be required for a future operation of the device; identifying an amount of data stored on the device that has not been previously backed up to an external storage device that is external to the device; backing up to an external backup device, a portion of the data that has not been previously backed up, the external backup device being external to the device; and deleting from the device the data that is backed up to the external backup device. A sum of an amount of the data deleted and the amount of available storage in the device is greater than the predicted amount of storage, and the backing up is performed after the predicting and automatically while the device is connected to a network.

Abstract: A method includes retrieving an object from storage and copying the object, generating a list that identifies one or more byte ranges, of the copy of the object, to be masked, providing the list to a masker controller microservice that examines a recipe corresponding to the copy of the object, where the recipe references a slice of the copy of the object, and the slice includes one or more data segments, masking, by the masker controller microservice, a segment of the slice that is in one of the byte ranges, to create a masked segment, and replacing, in the slice, the segment with the masked segment, to create a masked slice and creating a masked object recipe that contains a reference to the masked slice, creating a masked object that includes the masked slice, and that references any unmasked segments of the slice, and deduplicating the masked object.

Abstract: A calculator includes a processing core and a cache. The cache includes a data memory that holds data transferred from a main memory and a cache controller that controls transfer of data between the main memory and the data memory. The cache controller is configured to calculate, upon occurrence of a cache miss, a cycle count requested for arithmetic processing on one unit amount of data based on a cache miss occurrence interval and a memory access latency requested, and update a prefetch distance based on the calculated cycle count and the memory access latency, the prefetch distance indicating a relative distance on the main memory between a location from which the one unit amount of data transferred from the main memory due to the cache miss and a location from which a next one unit amount of data is to be prefetched.

Abstract: The On-demand Virtualized Data Recovery Apparatuses, Methods and Systems (“OVDR”) transforms data recovery request, mailbox backup data selection response inputs via OVDR components into mailbox backup data selection request, data recovery response outputs. A mailbox data recovery request datastructure associated with a user is obtained. Available mailbox backup data accessible to the user is determined. A selection of a subset of the available mailbox backup data to recover is obtained. A temporary mailbox environment associated with the mailbox data recovery request datastructure is spawned. A mailbox, corresponding to a mailbox account included in the selected subset of the available mailbox backup data, is created on the temporary mailbox environment. Mailbox data items, corresponding to mailbox data items associated with the mailbox account that are included in the selected subset of data, are restored to the created mailbox.

Abstract: A system for providing data protection services for user data associated with calendar groups generated by an application includes persistent storage for storing user data backups and a manager. The manager is programmed to identify a backup generation event for the user data associated with a calendar group based on a protection policy, obtain user data associated with the backup generation event from the application in response to identifying the backup generation event, select a calendar of calendars included in the user data, obtain user metadata associated with the calendar, generate calendar group information associated with the calendar using the user data and the user metadata, generate a user data backup using the user data, the calendar group information, and the user metadata, in which the user data backup comprises backup data and backup metadata.

Abstract: Techniques are provided for compacting indirect blocks. For example, an object is represented as a structure comprising data blocks within which data of the object is stored and indirect blocks comprising block numbers of where the data blocks are located in storage. Block numbers within a set of indirect blocks are compacted into a compacted indirect block comprising a base block number, a count of additional block numbers after the base block number in the compacted indirect block, and a pattern of the block numbers in the compacted indirect block. The compacted indirect block is stored into memory for processing access operations to the object.

Abstract: A method includes receiving an object from a client as part of a data ingestion process, directing the object to an object access microservice, providing a copy of the object to a masker worker microservice, masking the copy of the object to create a masked object, and the masking of the copy of the object is performed inline prior to storage of the object, deduplicating the object, and storing the masked object and the object in storage.

Abstract: Storing documents in an object store in the cloud by creating a container for the documents, defining a document record including unique document ID and an index. A backup record for every backup includes a timestamp for each backup, and a bitmask for each document in the container has a single bit position for each document to indicate the corresponding document as unchanged or that it has been changed/deleted. Each bit location in the bitmask is referenced by the index in the document record. Large documents have a multi-part record identifying the containers. During point-in-time recovery, containers that match a given timestamp are found, and documents where the bitmask bit is set are restored.

Abstract: Technologies are provided for storing data in a storage device based on an associated attribute or attributes. A storage device can be configured to write data to a storage location of the storage device based on an associated attribute. The attribute can describe one or more storage-related requirements of the data. The storage device can identify one or more storage locations where the data can be stored that meet the storage-related requirements described by the attribute. A host computer can transmit an updated attribute for the data to the storage device to reflect new storage-related requirements for the data. The storage device can write the data to a new storage location that meets the new requirements. A mapping table can be maintained that associates a logical identifier for the data with the actual storage location where the data is stored.

Abstract: An apparatus (2) comprises processing circuitry (4) to perform speculative execution of instructions; a main cache storage region (30); a speculative cache storage region (32); and cache control circuitry (34) to allocate an entry, for which allocation is caused by a speculative memory access triggered by the processing circuitry, to the speculative cache storage region instead of the main cache storage region while the speculative memory access remains speculative. This can help protect against potential security attacks which exploit cache timing side-channels to gain information about allocations into the cache caused by speculative memory accesses.

Abstract: Embodiments of the present disclosure relate to a memory system and an operating method of the memory system. According to embodiments of the present disclosure, a memory system may set a plurality of physical function units and a read cache, may calculate, when a Read Look Ahead (RLA) execution condition is satisfied for a first physical function unit among the plurality of physical function units, a calibrated cache hit ratio for the first physical function unit based on one or more cache hit ratios for the first physical function unit calculated after a predetermined first reference time point, and may determine whether to execute an RLA operation for the first physical function unit based on the calibrated cache hit ratio for the first physical function unit.

Abstract: Methods and systems related to memory reduction in a system by oversubscribing physical memory shared among compute entities are provided. A portion of the memory includes a combination of a portion of a first physical memory of a first type and a logical pooled memory associated with the system. A logical pooled memory controller is configured to: (1) track both a status of whether a page of the logical pooled memory allocated to any of the plurality of compute entities is a known-pattern page and a relationship between logical memory addresses and physical memory addresses associated with any allocated logical pooled memory, and (2) allow the write operation to write data to any available space in the second physical memory of the first type only up to an extent of physical memory that corresponds to the portion of the logical pooled memory previously allocated to the compute entity.

Abstract: A memory system may include: a memory device comprising a plurality of channels, a plurality of dies coupled to the respective channels, and a plurality of super blocks; and a controller suitable for controlling the memory device, wherein the controller includes: a detector suitable for searching for a first available reserved block in a first die, when a bad block has occurred in the first die which is coupled to a first channel and belongs to a first super block group, and searching for a second available reserved block in a second die which is coupled to the first channel and belongs to a second super block group when the first available reserved block is not present in the first die; and an assignor suitable for replacing the bad block with the second available reserved block when the second available reserved block is present.

Abstract: A method that is performed for backing up data. The method includes obtaining an incremental backup request; and in response to the incremental backup request: obtaining an asset and an asset entry associated with the incremental backup request; dividing the asset into pseudo-assets based on the asset entry; storing the pseudo-assets across backup storages to generate incremental pseudo-asset backups; initiating the merging of the incremental pseudo-asset backups to generate an incremental asset backup; and initiating the merging of the incremental asset backup with a previously generated full asset backup associated with the incremental backup request to generate a first synthetic full asset backup.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to evict in a dual datapath victim cache system. An example apparatus includes a cache storage, a cache controller operable to receive a first memory operation and a second memory operation concurrently, comparison logic operable to identify if the first and second memory operations missed in the cache storage, and a replacement policy component operable to, when at least one of the first and second memory operations corresponds to a miss in the cache storage, reserve an entry in the cache storage to evict based on the first and second memory operations.

Abstract: A method may include receiving, by a first computing system, a first request from a first client device to download content. The method may further include receiving, by the first computing system from a second computing system, first information. The first information may be indicative of a first version of the content that the first client device is authorized to download and a source from which the first version of the content can be downloaded. The method may also include determining, by the first computing system and based at least in part on the first information, that the first version of the content is already present on the first computing system. The method may additionally include sending, from the first computing system to the first client device, the first version of the content or second information, the second information indicative of the first version of the content.

Abstract: Techniques disclosed herein are used for restoring deduplicated backup data from cloud-based storage and from multi-node replicated files systems, and they also may be used in more traditional data storage technologies. Pre-restore steps include analysis of deduplication indexes to identify data segments that are stored consecutively on storage media. Reading data in aggregate runs of consecutively stored data segments reduces interactions with storage media that hosts the deduplicated data and speeds up retrieval. Parallel reads from multiple storage devices in multi-node replicated file systems also speed up retrieval. An illustrative enhanced media agent pre-fetches data (stored in deduplicated form) in anticipation of read requests that are expected in the restore operation.