Abstract: A method for converting a redundant array of independent disks (RAID) to a more robust RAID level is disclosed. Such a method identifies, in a data storage environment, higher risk storage drives having a failure risk above a first threshold. The method determines a number of the higher risk storage drives that are contained within a RAID array of the data storage environment. The method determines whether the number exceeds a second threshold. The method also determines whether a destage rate associated with the RAID array is below a third threshold. In the event the number exceeds the second threshold and the destage rate is below the third threshold, the method converts the RAID array to a more robust RAID level. A corresponding system and computer program product are also disclosed.

Abstract: Embodiments described herein provide a storage management system. During operation, the system receives information indicating sets of pending load of a plurality of storage devices from one or more storage nodes of a distributed storage system. The set of pending load of a respective storage device includes a set of load from host operations and a set of load from background operations on the storage device. The system can receive a request for a target resource associated with a disk operation from a client node of the distributed storage system. The system then selects, from the plurality of storage devices, a storage device with the smallest set of pending load based on the sets of pending load as the target resource and sends the target resource to the client node.

Abstract: A memory system includes a memory device including a plurality of normal memory blocks and a plurality of dummy memory blocks; and a controller suitable for controlling the memory device, wherein the controller includes: a memory suitable for temporarily storing user data corresponding to a write command; and a processor suitable for performing a one-shot program operation of programming the user data into an open memory block in the memory device by comparing a size of the user data with a reference size for the one-shot program operation.

Abstract: Facilitating page table entry (PTE) maintenance in processor-based devices is disclosed. In this regard, a processor-based device includes processing elements (PEs) configured to support two new coherence states: walker-readable (W) and modified walker accessible (MW). The W coherence state indicates that read access to a corresponding coherence granule by hardware table walkers (HTWs) is permitted, but all write operations and all read operations by non-HTW agents are disallowed. The MW coherence state indicates that cached copies of the coherence granule visible only to HTWs may exist in other caches. In some embodiments, each PE is also configured to support a special page table entry (SP-PTE) field store instruction for modifying SP-PTE fields of a PTE, indicating to the PE's local cache that the corresponding coherence granule should transition to the MW state, and indicating to remote local caches that copies of the coherence granule should update their coherence state.

Abstract: One embodiment facilitates data placement. During operation, the system monitors a condition of a plurality of blocks of a non-volatile memory. The system determines that a condition of a first block falls below a first predetermined threshold, wherein the first block has a first capacity. The system formats the first block to obtain a second block which has a second capacity, wherein the second capacity is less than the first capacity.

Abstract: A data alignment (DA) computing device is communicatively coupled to a first and a second data storage device. The first data storage device stores an array of partitions including a first subset and a second subset of partitions, and metadata associated with the array that includes a reference pointer for each partition. The DA computing device updates the metadata to remove the reference pointers for the second subset of partitions and thereby remove the second subset from the array, stores a partition table defining the first subset within the first data storage device and the second subset within the second data storage device, stores the metadata associated with the array within the second data storage device, updates the second data storage device to include the second subset of partitions, and updates the metadata stored by the data storage devices to link the second subset of partitions to the array.

Abstract: An apparatus includes a first device configured to generate a transaction request targeted to a first address, a switch, coupled to the first device and configured to the route the transaction request, a port coupled to the peripheral switch and the data processing network, and a system memory management unit, coupled to the port. The system memory management unit is configured for receiving an address query for the first address from the peripheral port translating the first address to a second address, accessing attributes of a device associated with the second address and responding to the query. Access validation for the transaction request is confirmed or denied dependent upon the second address and the attributes of the device associated with the second address. The first device may be a peripheral device, the switch may be a peripheral switch and the port may be a peripheral port.

Abstract: The subject matter described herein analyzes an item that is a candidate for admission into or eviction from a cache to determine characteristics of the item. The characteristics include at least one of item content and item source. A score associated with the item is calculated based on the determined characteristics. The item is admitted into, or evicted from, the cache based on the calculated score.

Abstract: Embodiments of the present disclosure provide a computer-implemented method and an apparatus for a storage system. The method comprises: in response to receiving a read request of a first container for data in a storage device, obtaining an identifier associated with the read request; searching for metadata of the read request in a metadata set based on the identifier, the metadata recording addressing information of the read request, the metadata set including metadata of access requests for the storage device during a past period; and in response to finding the metadata of the read request in the metadata set, determining, based on the metadata, a cached page of a second container storing the data; and providing the cached page from the second container to the first container to avoid reading the data from the storage device.

Abstract: A computational device determines whether one or more tasks are waiting for accessing a cache for more than a predetermined amount of time while least recently used (LRU) based replacement of tracks are being performed for the cache via demotion of tracks from a LRU list of tracks corresponding to the cache. In response to determining that one or more tasks are waiting for accessing the cache for more than the predetermined amount of time, in addition to continuing to demote tracks from the LRU list, a plurality of deadlock prevention demotion tasks demote tracks from the cache.

Abstract: The exemplary embodiments provide an in-memory database which uses a non-volatile memory as a primary storage, uses a volatile memory for data which exceeds a predetermined capacity of the non-volatile memory, as a secondary storage, and periodically stores a log file for data stored in the volatile memory in a block device, thereby ensuring a data consistency while overcoming a capacity limit of the non-volatile memory.

Abstract: A storage device includes a first physical space including first nonvolatile memory devices, a second physical space including second nonvolatile memory devices physically isolated from the first nonvolatile memory devices, and a storage controller that fetches a command from an external device and performs an operation corresponding to the command in any one of the first and second physical spaces, based on information included in the fetched command.

Abstract: Check point recovery based on identifying used blocks for block-based backup files is described. At least one data block is identified that is used by a system since a point in time in response to receiving a request to restore the system based on the point in time. At least one data block, corresponding to the identified at least one data block, is recovered from at least one backup file for the system, without reading each data block backed up via the at least one backup file for the system. The system is restored based on the recovered at least one data block.

Abstract: An information handling system may include a resistive memory buffer to supplement a system main memory unit of the information handling system. A processor of the information handling system may map the resistive memory buffer as system memory, along with the system main memory unit. The processor may use the system memory, including the resistive memory buffer and the system main memory unit in executing one or more applications. The resistive memory buffer may improve performance of the information handling system, such as during hibernation and wake-up processes and memory flush processes.

Abstract: The present invention facilitates efficient and effective utilization of storage management features. In one embodiment, a system comprises: a storage component, a memory controller, and a communication link. The storage component stores information. The memory controller controls the storage component. The communication link communicatively couples the storage component and the memory controller. In one embodiment, the communication link communicates storage system management information between the memory storage component and memory controller, and communication of the storage system management information does not interfere with command/address information communication and data information communication.

Abstract: A memory system includes a memory device for storing data; and a memory controller performing a program operation on the memory device by using one of a first program mode and a second program mode. The memory controller counts a number of program operations performed by using the first program mode in which a ratio of dummy data to program data is greater than or equal to a predetermined value; and changes the program mode to the second program mode from the first program mode, when the counted number is greater than or equal to a predetermined number.

Abstract: Configuration state registers grouped based on functional affinity. An identification of an in-memory configuration state register for which memory is assigned is obtained. Based on the identification, an offset into the memory at which the in-memory configuration state register is stored is determined. The offset is allocated to the in-memory configuration state register based on functional affinity of the in-memory configuration state register. The in-memory configuration state register is accessed using at least the offset.

Abstract: An apparatus comprises processing circuitry for accessing data in a physically-indexed cache. Set indicator recording circuitry is provided to record a set indicator corresponding to a target physical address, where the set indicator depends on which set of one or more storage locations of the cache corresponds to the target physical address. The set indicator is insufficient to identify the target physical address itself. This enables performance issues caused by contention of data items for individual sets in a physically-indexed set-associative or direct-mapped cache to be identified without needing to expose the physical address itself to potentially insecure processes or devices.

Abstract: Example implementations relate to persistent virtual address spaces. In one example, persistent virtual address spaces can employ a non-transitory processor readable medium including instructions to receive a whole data structure of a virtual address space (VAS) associated with a process, where the whole data structure includes data and metadata of the VAS, and store the data and the metadata of the VAS in a non-volatile memory to form a persistent VAS (PVAS).

Abstract: A backup agent for generating backups includes a persistent storage and a backup manager. The persistent storage stores backup/restoration policies. The backup manager obtains production host computing resource characteristics associated with production hosts; performs a computing resource analysis of the production host computing resource characteristics to obtain resource profiles for each of the production hosts; performs an availability analysis of the obtained resource profiles to determine an application-level computing resources distribution for generating the backups; coordinates generating the backups using the application-level computing resource distribution and the backup/restoration policies to obtain the backups; and stores the obtained backups in backup storage.