Abstract: A storage system and storage control method are provided in which a plurality of volumes to be processed by a storage control unit are distributed and evacuated in a normal storage control unit without recovering redundancy of the storage control unit having decreased redundancy, and the storage control unit itself having the decreased redundancy is deleted after the evacuating is completed, and thus reservation information processing resources for guaranteeing recoverability of the redundancy become unnecessary.

Abstract: The indication of a database backup process starting is received. A plurality of buffer manipulator threads are marked as active. A determination is made whether any of the plurality of buffer manipulator threads marked as active in the database backup process become idle. In response to determining that at least one buffer manipulator thread in the database backup process becomes idle, the at least one idle buffer manipulator thread is reassigned to a first largest tablespace in the database that has not completed the database backup process. The first largest tablespace has a largest storage capacity relative to other tablespaces in the database.

Abstract: The present disclosure relates to a method, device and computer program product for managing a backup system. In a method for managing a backup system, at least one backup attribute of a backup demand on the backup system is determined, the at least one backup attribute describing at least one aspect of a demand on the backup system from a user of the backup system. A plurality of backup records of a plurality of historical backup operations performed on the backup system are obtained, respectively. Data distribution associated with the at least one backup attribute is determined based on the plurality of backup records.

Abstract: Embodiments of the present disclosure provide a storage management method, an electronic device, and a computer program product. The method includes: determining, in a storage device set, a plurality of candidate subsets of storage devices used for data backup, wherein the plurality of candidate subsets include substantially the same number of storage devices. The method further includes: determining global balance degrees respectively corresponding to the plurality of candidate subsets, wherein the global balance degree indicates a usage balance degree of the storage device set when storage devices in a corresponding candidate subset are used for data backup. The method further includes: determining a target subset of storage devices for data backup in the plurality of candidate subsets based on the global balance degrees.

Abstract: Methods, systems, and devices for system-level timing budget improvements are described. Each memory die in a memory device may determine an offset between its system clock signal and its data clock signal. The offsets of each memory die in the memory device may be different; e.g., having different magnitudes and/or polarities. A memory die in the memory device may adjust its own data clock signal by a delay that is based on the offsets of two or more memory die in the device. The memory die may adjust its data clock signal by setting a fuse in a delay adjuster on the memory die. Adjusting the data clock signal may match an offset of a first memory die with an offset of a second memory die.

Abstract: Methods and systems for file level prioritization during a data backup operation are described. According to some embodiments, the method includes in response to a request to backup one or more files and for each file, sniffing file information of the file. The method further includes determining a backup critical level of the file based on the file information. The method further includes assigning a weighted value corresponding to the backup critical level of the file. The method further includes using the weighted value to calculate a Euclidean distance of the file to a next consecutive file.

Abstract: A determination can be made of a type of memory access workload for an application. A determination can be made whether the memory access workload for the application is associated with sequential read operations. The data associated with the application can be stored at one of a cache of a first type or another cache of a second type based on the determination of whether the memory workload for the application is associated with sequential read operations.

Abstract: Verifiable intra-cluster migration (VICM) for a chunk storage system is disclosed. VICM can migrate data from a first portion of a cluster to a second portion of a cluster. VICM can comprise locking a first portion of a cluster and locking a corresponding first cluster table during a preparation phase. Chunks of the first portion can then be migrated, during a migration phase, to the second portion and a second cluster table, corresponding to the second portion, can be updated accordingly. Garbage management operations, including recovery operations, can be performed via the second cluster table and the second portion during the migration phase. Upon completion of the migration phase, a reconciliation phase can comprise verifying chunk relationships of the second cluster table and the second portion based on the first cluster table. Exceptions to the verification can be reported via an exception report.

Abstract: A controller may include a memory configured to store a map update list in which information of map segments whose mapping information is to be updated is registered The controller may also include an unmap module. The unmap module may, in response to receiving an unmap command, generate a list information bitmap indicating map segments which are already registered in the map update list, check, using the generate list information bitmap, whether one or more unmap target map segments corresponding to the unmap command overlap the map segments registered in the map update list, using the generate list information bitmap, and selectively register the one or more unmap target map segments into the map update list according to the check result.

Abstract: A technique for backing up snapshots in a multi-cloud environment includes accessing multiple cloud storage providers and obtaining therefrom respective sets of storage performance data. The technique further includes receiving storage requirements for snapshots of a data object and selecting, based on the requirements and the storage performance data, a designated cloud storage provider for receiving archived snapshots of the data object. The technique then transmits one or more snapshots of the data object to the designated cloud storage provider for archiving.

Abstract: According to one embodiment, a hardware-based processing node of a plurality of hardware-based processing nodes in an object memory fabric can comprise a memory module storing and managing a plurality of memory objects in a hierarchy of the object memory fabric. Each memory object can be created natively within the memory module, accessed using a single memory reference instruction without Input/Output (I/O) instructions, and managed by the memory module at a single memory layer. The object memory fabric can utilize a memory fabric protocol between the hardware-based processing node and one or more other nodes of the plurality of hardware-based processing nodes to distribute and track the memory objects across the object memory fabric. The memory fabric protocol can be utilized across a dedicated link or across a shared link between the hardware-based processing node and one or more other nodes of the plurality of hardware-based processing nodes.

Abstract: The described technology is generally directed towards garbage collecting content selection graphs and related data from in an in-memory content selection graph data store. When a set of content selection graphs expire, a more current content selection graph set becomes active, and the storage space (e.g., in a Redis cache) used by the expired content selection graphs is reclaimed via garbage collection. Some graphs can be replaced before use, referred to as orphaned graphs, and the storage space for any such orphaned graphs is also reclaimed during garbage collection. Also garbage collected is storage space including related data structures used to generate and validate graphs.

Abstract: Embodiments are disclosed for performing cache aware searching. In response to a search query, a first bucket and a second bucket in remote storage for processing the search query. A determination is made that a first file in the first bucket is present in a cache when the search query is received. In response to the search query, a search is performed using the first file based on the determination that the first file is present in the cache when the search query is received, and the search is performed using a second file from the second bucket once the second file is stored in the cache.

Abstract: A method and apparatus is disclosed for transferring data from a first processor core to a second processor core. The first processor core executes a stash instruction having a first operand associated with a data address of the data. A second processor core is determined to be a stash target for a stash message, based on the data address or a second operand. A stash message is sent to the second processor core, notifying the second processor core of the written data. Responsive to receiving the stash message, the second processor core can opt to store the data in its cache. The data may be included in the stash message or retrieved in response to a read request by the second processing core. The second processor core may be determined by prediction based, at least in part, on monitored data transactions.

Abstract: An implementation of the disclosure provides a system comprising a storage array comprising a storage controller coupled to the storage array. The storage controller comprising a processing device to remap a plurality of deduplication references in a deduplication map to point to an earlier occurrence of duplicate data of a data block for the deduplication map. The processing device further to update an entry of the deduplication map associated with the plurality of deduplication references with a record indicating that the entry is no longer referenced and trim the entry from the deduplication map that is associated with the record.

Abstract: This invention relates to the use of dynamic MPU regions to enhance the security and ease of development of multitasking embedded and similar systems.

Abstract: An information processing system includes a CPU that is configured to output an address and a writing instruction signal instructing to write data to the address or a reading instruction signal instructing to read data from the address, to a selector, the selector that is configured by hardware such that an output destination of data input from the CPU is determined according to the address, the writing instruction signal, and the reading instruction signal, a volatile memory that is configured to store data including snapshot image information and initial setting data for a non-standard device including a register when the information processing system is started, on the basis of a signal output from the selector, and the register that has the same address as an address of a memory region of the volatile memory storing the initial setting data.

Abstract: Solutions for processing a redundant array of storage drives receiving a rebuilding request of a redundant array of storage drives. The redundant array has a first storage drive to be replaced. In response to no spare storage drive being available to logically replace the first storage drive, a second storage drive is identified, which is a source storage drive of a disk balance process being performed. A rebuilding of the redundant array is initiated by reconstructing data of the first storage drive on the second storage drive during the disk balance process.

Abstract: Described herein are systems and techniques to efficiently cache data for streaming applications. A cache can be organized to include multiple cache segments, and each cache segment can include multiple cache blocks. A cache entry can be created for streaming data, and the streaming data can be streamed directly into a first cache block. When the first cache block is full, a next cache block can be identified, in a same cache segment or in a new cache segment. The streaming data can be streamed directly into the next cache block, and into any further cache blocks as needed.

Abstract: A garbage collection process, wherein a system, concurrently with execution of a mutator application that modifies a heap memory computes, for each of a plurality of regions in the heap memory, an estimate indicative of a time required to evacuate the respective region. Thereafter, during a garbage collection pause having a particular pause duration, the system selects a candidate subset of memory regions for evacuation. The system merges the estimates indicative of the time required to evacuate each region of the candidate subset and determines a remaining time during the pause. The system may determine that the total estimated evacuation time to evacuate the candidate subset of regions does not exceed the determined first remaining time, and may evacuate each region in the candidate subset of memory regions for evacuation.