Abstract: Disclosed are systems and methods for using a priority cache to store frequently used data items by an application. The priority cache may include multiple cache regions. Each of the cache regions may be associated with a different priority level. When a data item is to be stored in the priority cache, the application may review the context of the data item to determine if the data item may be used again in the near future. Based on that determination, the application may be configured to assign a priority level to the data item. The data item may then be stored in the appropriate cache region according to its assigned priority level.

Abstract: A new snapshot of a storage volume is created by suppressing write requests. Once pending write requests from the computing nodes are completed, storage nodes create a new snapshot for the storage volume by allocating a new segment to the new snapshot. Subsequent write requests to the storage volume are then performed on the segments allocated to the new snapshot. An orchestration layer implements a bundled application that is provisioned with storage volumes and containers. A snapshot of the application may be created and used to rollback or clone the application. The amount of processing cores, memory, and containers may be increased or decreased based on usage. Amount of storage allocated to a storage volume may be augmented by a snapshot reservation ratio. The snapshot reservation ratio is adjusted over time according to usage.

Abstract: Provided are systems, methods, and media for simultaneous, non-atomic request processing of snooped operations of a broadcast scope within a SMP system. An example method includes detecting, by a first controller, based on a set of coherency resolution conditions, whether there are coherency resolution problems between two snooped operations. The method includes in response to detecting, by the first controller, that coherency resolution problems will not result, transmitting, from the first controller to a second controller, an indication signal indicating that coherency resolution problems will not result from the operation. The set of coherency resolution conditions includes: (a) detecting that a second operation of the two snooped operations operation is of a predetermined type, (b) detecting at time of snooping of the second operation that a directory state does not allow for exclusive data, and (c) detecting that the first controller has started committing to an update.

Abstract: A hash content addressable memory system includes a hash content addressable memory block (HCB) that is a physical subsystem of the hash content addressable memory system. The first HCB include first bus select logic. The first bus select logic is connected to a plurality of key buses and to a plurality of operation buses. Each key bus from the plurality of key buses and each operation bus from the plurality of operation buses is connected to one and only one client in a plurality of clients. Every client in the plurality of clients is connected to only one key bus from the plurality of key buses and is connected to only one operation bus from the plurality of operation buses.

Abstract: A memory system includes: a memory device including a closed memory block; an update block detector detecting a total sum of valid page decrease amounts and the number of update blocks based on the number of valid pages of the closed memory block that are counted before and after a map update operation; and a garbage collector performing a garbage collection operation on a victim block, based on the number of free blocks in the memory device, the counted number of the update blocks and the calculated total sum of the valid page decrease amounts.

Abstract: A controller includes a memory device storing data and including a memory interface a processor; and a memory, wherein, when data is stored in all pages of an open block of a memory device, the processor determines a number of valid pages in the open block and performs a garbage collection on the open block when the number of valid page(s) is determined to be less than or equal to a threshold value, wherein the number ranges from zero to the total number of pages in the open block.

Abstract: A method for memory management includes allocating an available block of memory for use by a first object, determining that the block of memory includes at least a portion of a second object, the second object no longer being used by an application associated with the second object, determining that the second object utilized at least one resource that was not shutdown, releasing the at least one resource, and writing to the block of memory with the first object.

Abstract: A data processing system includes a host device including a first volatile memory which includes an exclusive region and a shared region, and a first control unit; and a data storage device including a second control unit, and configured to store data to be accessed by the host device, wherein the first control unit adds a header information including an identification information and a state information, to data to be stored in the data storage device, and stores the data added with the header information, in the shared region, according to a request of the second control unit.

Abstract: A processing system includes a processing core to execute a virtual machine (VM) comprising a guest operating system (OS) and a memory management unit, communicatively coupled to the processing core, comprising a storage device to store an extended page table entry (EPTE) comprising a mapping from a guest physical address (GPA) associated with the guest OS to an identifier of a memory frame, a first plurality of access right flags associated with accessing the memory frame in a first page mode referenced by an attribute of a memory page identified by the GPA, and a second plurality of access right flags associated with accessing the memory frame in a second page mode referenced by the attribute of the memory page identified by the GPA.

Abstract: A server LPAR operating in a virtualized computer shares pages with client LPARs using a shared memory region (SMR). A virtualization function of the computer receives a get-page-ID request associated with a client LPAR to identify a physical page corresponding to a shared page included in the SMR. The virtualization function requests the server LPAR to provide an identity of the physical page. The virtualization function receives a page-ID response comprising the identity of a server LPAR logical page that corresponds to the physical page. The virtualization element determines a physical page identity and communicates the physical page identity to the client LPAR. The virtualization element receives a page ID enter request and enters an identity of the physical page into a translation element of the computer to associate a client LPAR logical page with the physical page.

Abstract: A method, an apparatus, and a system for migrating virtual machine backup information, which implement backup information migration after a virtual machine is migrated. The method includes: receiving, by a first backup server, a migration trigger message, where the migration trigger message carries pre-migration virtual-machine identification information and indication information of a second backup server; determining, by the first backup server, backup information of the virtual machine according to the pre-migration virtual-machine identification information; and sending, by the first backup server, the backup information to the second backup server. Therefore, the migrated virtual machine inherits backup information existing before the migration, such that the migrated virtual machine continues to be protected by backup data existing before the migration, and data of the virtual machine is backed up according to a backup policy existing before the migration.

Abstract: A system and method for performing replication using mediums. A snapshot ‘S’ is selected for replication, and the anchor medium ‘M’ of S is identified. The replica storage array ‘R’ to which M is being replicated determines a list of medium extents which are available. R sends this list to an original storage array ‘O’ and O generates a list of medium extents which need to be sent to R. Only those medium extents corresponding to M which R does not already have will be sent from O to R. Also, R can obtain medium extents from other source storage arrays during the replication process.

Abstract: Methods of detecting malicious code injected into memory of a computer system are disclosed. The memory injection detection methods may include enumerating memory regions of an address space in memory of computer system to create memory region address information. The memory region address information may be compared to loaded module address information to facilitate detection of malicious code memory injection.

Abstract: Certain embodiments disclosed herein reduce or eliminate a communication bottleneck at the storage manager by reducing communication with the storage manager while maintaining functionality of an information management system. In some implementations, a client obtains information for enabling a secondary storage job (e.g., a backup or restore) from a storage manager and stores the information (which may be referred to as job metadata) in a local cache. The client may then reuse the job metadata for multiple storage jobs reducing the frequency of communication with the storage manager. When a configuration of the information management system changes, or the availability of resources changes, the storage manager can push updates to the job metadata to the clients. Further, a client can periodically request updated job metadata from the storage manager ensuring that the client does not rely on out-of-date job metadata.

Abstract: A storage infrastructure and method for efficiently handing block I/O requests. An infrastructure is described that includes flash memory and a controller that includes: a two dimensional (2D) linked list structure for temporarily storing BIO requests, wherein each BIO request specifies a set of LBAs and wherein the 2D linked list structure includes N vertical linked lists; a BIO request loader that applies a hash function to each LBA in a received BIO request to associate each LBA to one of N hash values, and loads the received BIO request into a horizontal linked list in the 2D linked list structure in which each LBA resides within a vertical linked list based on an associated hash values; and a linked list manager that determines which LBAs in the 2D linked list structure are eligible for processing and when a horizontal linked list can be removed.

Abstract: A storage system and a system garbage collection method are provided. The storage system includes a first controller, a second controller, and a solid state disk. The first controller or the second controller manages storage space of the solid state disk in a unit of a segment. The first controller is configured to perform system garbage collection on multiple segments of segments managed by the first controller. The second controller is configured to: when the first controller performs system garbage collection, perform system garbage collection on multiple segments of segments managed by the second controller. The multiple segments of the segments managed by the first controller and the multiple segments of the segments managed by the second controller are allocated within a same time period. Therefore, a quantity of times of write amplification in the solid state disk can be reduced.

Abstract: An information processing apparatus includes a receiving unit that receives data from the outside, a first memory space to which data is written from the receiving unit, a second memory space to which a flag for synchronization is written, and an arithmetic unit. The arithmetic unit includes a synchronization control unit that instructs the receiving unit to synchronize the first memory space and the second memory space. The receiving unit includes a synchronization command issuing unit that issues a synchronization command to the first memory space and the second memory space, and a synchronization command receiving unit that receives a response indicating that data writing is guaranteed from the first memory space and a response indicating that flag writing is guaranteed from the second memory space, and responds to the arithmetic unit that synchronization is completed when writing to the first memory space and the second memory space is guaranteed.

Abstract: A backup server is used to determine if dynamic parallel save streams (DPSS) between a storage device and a backup storage device is recommended. An analyzer on the backup server reviews the streaming information for data objects in a storage device. Based upon the data stream information, the analyzer can either recommend the implementation of DPSS or not recommend DPSS. If DPSS is recommended, the analyzer will further recommend a specific number of parallel save streams.

Abstract: A distributed storage system stores a storage volume as segments that are allocated as needed and assigned VSIDs according to a monotonically increasing counter. The storage volume may be provisioned by an orchestration layer that manages the storage volumes as well as containers executing executable components of the storage volume. A storage volume may be stored across multiple tiers with a storage node managing on which tier a segment is stored based on a volume tier policy and usage of the segments. The tiering policy may be used to relocate the entire storage volume to a tier, such as a cloud computing platform, after which an application may be restored on the tier. Segments on a tier with built in redundancy may be used as both primary and backup copies.

Abstract: Systems and methods for determining locality of an incoming command relative to previously identified write or read streams is disclosed. NVM Express (NVMe) implements a paired submission queue and completion queue mechanism, with host software on the host device placing commands into multiple submission queues. The memory device fetches the commands from the multiple submission queues, which results in the incoming commands being interspersed. In order to determine whether the incoming commands should be assigned to previously identified read or write streams, the locality of the incoming commands relative to the previously identified read or write streams is analyzed. One example of locality is proximity in address space. In response to determining locality, the incoming commands are assigned to the various streams.