Abstract: A data processing system and a method of data processing are provided. The system comprises a first data processing agent, a second data processing agent, and a third data processing agent. Each of the second and third data processing agents have access to one or more caches. A messaging mechanism conveys a message from the first data processing agent to one of the second and third data processing agents specified as a message destination agent in the message. A stashing manager monitors the messaging mechanism and selectively causes data associated with the message to be cached for access by the message destination agent in a cache of the one or more caches in dependence on at least one parameter associated with the message and at least one stashing control parameter defined for a link from the first data processing agent to the message destination agent.

Abstract: Example methods are provided for unbalanced storage resource usage configuration for a distributed storage system in a virtualized computing environment. The method may comprise: obtaining usage data associated with multiple storage resources forming the distributed storage system; and based on the usage data, determining a higher usage set and a lower usage set from the multiple storage resources. The method also comprise configuring the multiple hosts to use the multiple storage resources in an unbalanced manner by using the higher usage set at a higher usage level compared to the lower usage set.

Abstract: Aspects of the present disclosure provide for operations of a key-value store (KVS) that uses journaling with storage of data (e.g., key data or value data of a key-value pair) in different types of data storage objects (e.g., data storage formats) selected based on one or more criteria.

Abstract: A storage device and a method of operating the storage device include various memory devices. The storage device includes a plurality of memory devices each including at least one or more read cache memory blocks and a plurality of main memory blocks; and a memory controller configured to spread and store data stored in an identical memory device, having a read count representing a number of read requests and exceeding a threshold value, among data stored in the plurality of main memory blocks, to the at least one or more read cache memory blocks included in each of the plurality of memory devices.

Abstract: Migrating data from a first storage device to a second storage device includes causing all data of the first storage device to be copied from the first storage device to the second storage device and causing the host computer to transition from performing I/O operations with the first storage device to performing I/O operations with the second storage device by modifying metadata used for I/O operations to change a mapping of logical devices to physical devices only after causing all data of the first storage device to be copied from the first storage device to the second storage device. Migrating data from the first storage device to the second storage device is independent of any I/O operations by the host. A data write operation from the host is acknowledged only after the data has been successfully written to both the first storage device and the second storage device.

Abstract: Applications may request persistent storage in nonvolatile memory. The persistent storage is maintained across power events and application instantiations. Persistent storage may be maintained by systems with or without memory management units.

Abstract: Systems and methods for managing access data are disclosed. One method can comprise receiving prediction information relating to one or more content options and requesting access information associated with the prediction information. At least a portion of the received access information can be processed to provide a preliminary access decision. A request for access relating to the one or more data options can be received and an access decision based at least in part on the preliminary access decision can be provided.

Abstract: A processing device is provided which includes memory and at least one processor. The memory includes main memory and cache memory in communication with the main memory via a link. The at least one processor is configured to receive a request for a cache line and read the cache line from main memory. The at least one processor is also configured to compress the cache line according to a compression algorithm and, when the compressed cache line includes at least one byte predicted not to be accessed, drop the at least one byte from the compressed cache line based on whether the compression algorithm is determined to successfully compress the cache line according to a compression parameter.

Abstract: Techniques involve receiving a write request for a first storage block in a source storage area during copying first data from the source storage area to a target storage area. The techniques further involve writing second data associated with the write request into a second storage block of the target storage area, wherein the second storage block corresponds to the first storage block. The techniques further involve updating an indicator associated with the first storage block, wherein the indicator indicates that the second data is written by the write request during the copying. Such techniques enable the data to be written into the target storage area directly without being written into the source storage area by setting an indicator indicating whether a storage block receives a write request during data copying. Accordingly, such techniques can improve write performance during data copying, and extend source storage area lifetime.

Abstract: Systems and methods for providing data protection services are provided. In one example, data protection services are provided in a high availability system. Server side copies of the data stored in or by nodes or servers of the high availability system are generated. The server side copies are independent of the operating systems and storage hierarchies associated with the actual data. The resulting backup copies can be generated by storing metadata that includes references to the original data. The backup copies can also be restored without being hindered by the operating systems and storage hierarchies of the highly available system.

Abstract: A semiconductor apparatus may include technology to identify two or more types of storage controller traffic, direct a first identified type of storage controller traffic along a fixed processing path, and direct a second type of storage controller traffic along a programmable processing path. Other embodiments are disclosed and claimed.

Abstract: A method, computer program product, and computing system for identifying one or more first layer metadata blocks that map to one or more second layer metadata blocks. A subset of the second layer metadata blocks that map to another second layer metadata block from the one or more second layer metadata blocks may be identified, thus defining one or more redirecting second layer metadata blocks. For each first layer metadata block of the one or more first layer metadata blocks: One or more first layer metadata blocks that map to the one or more redirecting second layer metadata blocks may be determined and the one or more first layer metadata blocks that map to the one or more redirecting second layer metadata blocks may be remapped to map to a target second layer metadata block.

Abstract: Systems and methods for identifying unused storage capacity within a computer network are disclosed. In one embodiment, in an information processing apparatus comprising at least one computer processor, a method for identifying unused storage capacity within a computer network may include: (1) querying a plurality of computing systems for each system's usage of a plurality of storage devices within a computer network; (2) receiving, from each of the computing systems, raw data comprising a logical identifier and a unique identifier for each storage device used; (3) processing the raw data to identify a correlation between the logical identifier and the unique identifier and a physical storage device; and (4) identifying one of the physical storage device that is not in use.

Abstract: Node resets in a distributed environment can be disruptive due to the need to reset shared state. However, a central system can notify all other nodes asynchronously of a pending event, and then multiple nodes can use that notification to mitigate costs when it actually happens. For example, in anticipation of a first node leaving a group of nodes, a second node can reduce its cache to store the cache from the first node. Additionally, a client device can be directed to the second node so as not to interrupt a service provided to the client device by the first node.

Abstract: Aspects of the disclosure provide for mechanisms for memory protection of virtual machines in a computer system. A method of the disclosure includes: obtaining, by a hypervisor, a guest page table associated with a virtual machine, wherein the guest page table comprises a first guest page table entry associated with a privilege flag indicating that a first virtual page of a guest memory of the virtual machine is accessible to unprivileged code; and in view of a determination that the virtual machine is running in a kernel mode, generating a first host page table in view of the guest page table, wherein the first host page table comprises a first host page table entry corresponding to the first guest page table entry, and wherein the first host page table entry is associated with a privilege flag indicating that the first virtual page is not accessible to the unprivileged code.

Abstract: A memory management method is provided. The method includes: performing a read operation on a target word line; reading a plurality of target physical pages of the target word line to obtain a plurality of hard bit codewords respectively corresponding to the target physical pages; generating soft information of each of a plurality of target memory cells of the target word line according to the hard bit codewords; identifying a plurality of confidence values corresponding to the target physical pages of each of the target memory cells according to a plurality of confidence tables and the soft information of the target memory cells; and performing an adjusted preset decoding operation according to the confidence values and the soft information, so as to obtain a plurality of final decoded codewords respectively corresponding to the target physical pages and complete the read operation.

Abstract: A technique for writing data in a file system includes aggregating data received in a set of I/O requests into a batch that includes multiple extents of data. After compressing a current extent of the batch and determining that the compressed extent does not fit in a space where a previous version of the extent is stored, the technique performs an FS-relocate operation by accessing an F S-hole list provided for the file system and selecting a hole, from the FS-relocate list, which is large enough to accommodate the compressed extent. The technique then places the compressed extent in the selected hole.

Abstract: A technique for writing data in a data storage system includes aggregating data received in a set of I/O requests into a batch that includes multiple extents of data. After compressing a current extent of the batch and determining that the compressed extent does not fit in a space where a previous version of the extent is stored, the technique performs a batch-relocate operation by gathering a set of mapping metadata for mapping each of the extents in the batch, identifying a set of holes indicated by the set of mapping metadata, and adding the holes to a batch-hole list. The technique then selects a hole, from the batch-hole list, which is big enough to accommodate the compressed extent, and places the compressed extent in the selected hole.

Abstract: An iterative graph algorithm accelerating method, system, and computer program product, include recording an order of access nodes in a memory layout, reordering the access nodes in the memory layout in accordance with the recorded order, and updating edge information of the reordered access nodes.

Abstract: A storage system and method are provided for preventing head-of-line blocking in a completion path. In one embodiment, a storage system is provided that is configured to: determine that a completion queue in a host is too full to store a completion entry; in response to determining that the completion queue in the host is too full to store the completion entry, temporarily store the completion entry in a data structure in the storage system; determine that space has become available in the completion queue in the host to store the completion entry; and in response to determining that space has become available in the completion queue in the host to store the completion entry, store, in the completion queue in the host, the completion entry that was temporarily stored in the data structure in the storage system.