Abstract: A resource tracking storage system can track and associate resource usage within storage devices to requesting virtual hosts. Controllers may be configured to receive commands for storage device usage sent from the requesting virtual hosts. Each command for storage device usage may result in a need for future maintenance work to be done within the storage device. Additionally, performance policies, which may be one or more set of rules, thresholds, and/or specifications that indicate a minimum (or maximum) level of performance by the storage device can be regulated by tracking and determining which hosts are degrading the performance of the storage device. With this solution, one or more performance policies can also be enforced by making sure one host is not negatively impacted from the negative storage device usage of another, errant host, even prior to the need for maintenance.

Abstract: A system includes a memory component and a processing device, operatively coupled with the memory component, to generate a physical presence security identification (PSID) for the memory component using a statistically random number generator. The processing device, operatively coupled with the memory component, can securely retrieve the PSID and revert the memory component to an original state using the PSID.

Abstract: Embodiments of the present disclosure relate to dynamically adjusting storage device system configurations. Information from one or more storage devices is collected. Dynamic adjustment of each storage device's system configuration is enabled based on the information. The information can include performance data, telemetry data, system configuration data, component configuration data, change events/commands, and/or alerts. Each storage device's components can be monitored with at least one daemon. Information patterns can be identified. The patterns can be matched to spikes in data traffic and/or storage device performance. The matched patterns and spikes can be correlated with each storage device's performance and errors. Storage device system configuration adjustment options can be determined. Rules for each option can be generated. Dynamic adjustment of each storage device's system configuration based on the generated one or more rules can be enabled.

Abstract: A multiple interface data exchange system utilizes a persistent in-memory storage in asynchronous data communication with a plurality of interfaces. Each interface is configured to communicate with at least one application using a particular communication protocol. The persistent in-memory storage stores tuple data sets received from applications transmitting data to the connected interface in a canonical (universal) format, automatically creating new tuples and updating existing tuples. The canonical format of the data is quickly queried in the persistent in-memory storage and available to other applications in connection with the multiple interface data exchange system regardless of the communication protocol used by a requesting application.

Abstract: Methods, systems, and devices for pattern generation for multi-channel memory array are described. A device may include a memory array and a circuit for testing the memory array. The memory array may include a first set of memory cells and a second set of memory cells, the first set of memory cells coupled with a first channel and the second set of memory cells coupled with a second channel. The circuit may be coupled with the memory array and may include a pattern generator and an output response analyzer. The pattern generator may be configured to selectively output a single pattern when operating in a single-pattern mode or a plurality of patterns when operating in a multi-pattern mode. The output response analyzer configured to determine whether the memory array includes one or more errors based at least in part on a pattern output by the pattern generator.

Abstract: Systems and methods for allocating memory and redirecting data writes based on temperature of memory modules in a cloud computing system are described. A method includes maintaining temperature profiles for a first plurality of memory modules and a second plurality of memory modules. The method includes automatically redirecting a first request to write to memory from a first compute entity being executed by the first processor to a selected one of a first plurality of memory chips, whose temperature does not meet or exceed the temperature threshold, included in at least the first plurality of memory modules and automatically redirecting a second request to write to memory from a second compute entity being executed by the second processor to a selected one of the second plurality of memory chips, whose temperature does not meet or exceed the temperature threshold, included in at least the second plurality of memory modules.

Abstract: Systems and methods provide techniques for more effective read/write management in collaborative data interaction frameworks. In response, embodiments of the present invention provide methods, apparatuses, systems, computing devices, and/or the like that are configured to enable effective and efficient read/write management in collaborative data interaction frameworks. For example, certain embodiments of the present invention provide methods, apparatuses, systems, computing devices, and/or the like that are configured to read/write management in collaborative data interaction frameworks using techniques that utilize asynchronous write request management along with partially decoupled read request management.

Abstract: Various embodiments enable a memory sub-system to perform a read operation based on consolidated memory region description data, which can be generated based on a memory region description data (e.g., SGL) provided by a host system for the read operation.

Abstract: A storage system has a memory with primary and secondary blocks. Data is stored redundantly in the primary and secondary memory blocks but in a different programming order. For example, data is programmed in the first memory block starting at a first wordline and ending at a last wordline, while data is programmed in the second memory block starting at the last wordline and ending at the first wordline.

Abstract: In a solution for accessing a storage system, a client sends, based on an obtained start address that is of a queue of an NVMe storage device and to which an access request points and an obtained logical address that is of the NVMe storage device and to which the access request points, a remote direct memory access command to a storage node in which the NVMe storage device is located.

Abstract: In one example, an apparatus comprises: a memory array having an array of memory elements arranged in rows and columns, each memory element being configured to store a data element; and a memory access circuit configured to: perform a row write operation to store a first group of data elements at a first row of the array of memory elements; perform a column read operation at a first column of the array of memory elements to obtain a second group of data elements; and perform a column write operation to store a third group of data elements at the first column of the array of memory elements to replace the second group of data elements.

Abstract: Proposed are concepts for providing resilience (i.e., fault tolerance) for the temporary data needs of a distributed file system. Such concepts may, for instance, provide a virtual storage layer in a data node of a distributed file system. The virtual storage layer may provide resilience for the temporary data needs of a Massively Parallel Processing (MPP) SQL on Hadoop engine.

Abstract: Techniques are used for enabling deduplication for asynchronous replication in a storage system. The techniques may be used to provide, among other things, retrieving, on a source system, a virtual index key corresponding to a logical address, and determining whether a deduplication index table for a target system includes an entry with the same virtual index key.

Abstract: Embodiments of the present invention disclose a data processing solution. In this solution, a hard disk receives a call instruction sent by a server, where the call instruction includes a function identifier of a to-be-called function and an operation address; and the hard disk calls the function in the hard disk based on the function identifier, and performs, based on the function, an operation on data corresponding to the operation address.

Abstract: An apparatus comprises at least one processing device configured to generate, for a storage system that is part of an active tier of a storage environment, at least one storage capacity forecast comprising probability values for storage capacity of the storage system over a designated time period. The processing device is also configured to determine whether any of the probability values exceed at least one designated storage capacity threshold and, responsive to determining that a given one of the probability values exceeds the at least one designated storage capacity threshold, to select remedial actions for freeing up space on the active tier of the storage environment. The processing device is further configured to initiate the selected remedial actions for freeing up space on the active tier of the storage environment to prevent the storage system from reaching a designated storage capacity error condition.

Abstract: A processor for supporting secure memory intent is disclosed. The processor of the disclosure includes a memory execution unit to access memory and a processor core coupled to the memory execution unit. The processor core is to receive a request to access a convertible page of the memory. In response to the request, the processor core to determine an intent for the convertible page in view of a page table entry (PTE) corresponding to the convertible page. The intent indicates whether the convertible page is to be accessed as at least one of a secure page or a non-secure page.

Abstract: A technique for managing data storage includes generating digests of chunks of data. The digests are arranged to provide similar results for similar chunks but to weight contributions from different regions of chunks differently based on their entropy. Chunks that differ in low-entropy regions tend to produce more similar digests than do chunks that differ in high-entropy regions. The technique further includes identifying similar chunks based on similarity of their digests and preforming data reduction on one chunk by reference to another, storing any differences between the chunks separately.

Abstract: Allocating distributed data structures and managing allocation of a symmetric heap can include defining, using a processor, the symmetric heap. The symmetric heap includes a symmetric partition for each process of a partitioned global address space (PGAS) system. Each symmetric partition of the symmetric heap begins at a same starting virtual memory address and has a same global symmetric break. One process of a plurality of processes of the PGAS system is configured as an allocator process that controls allocation of blocks of memory for each symmetric partition of the symmetric heap. Using the processor executing the allocator process, isomorphic fragmentation among the symmetric partitions of the symmetric heap is maintained.

Abstract: Telemetry data gathered from active deployed SAN nodes is used to create a machine learning model that predicts storage system performance, e.g. in terms of response time. The telemetry data may be filtered to remove outlier values and less relevant information before creating the training dataset. Engineered features may be created that include types of data that are not present in the telemetry data. For example, data types from the telemetry data may be combined to create engineered features that are more relevant than the individual data types. The engineered features are included in the training dataset. The machine learning model may be used to test possible configurations for a planned SAN node based on expected workload and performance requirements. Outputted data may include satisfactory configurations for a planned storage system.

Abstract: Merging of portions of ordered event streams is disclosed. The disclosed merging of events can limit loss of order of events from streams in exchange for reduced computational load by grouping events according to a pseudo-epoch, wherein events are stored according to a scheme, even though the grouping can result reading events in a different order that that in which the events were written. However, by grouping the events, there can be fewer transitions between storage schemes when reading events than if they were read in the same order in which they were written, thereby reducing computational load. Moreover, restraints on the loss of order can be imposed by selecting a maximum progress window and generally restricting groups from comprising events two different storage schemes. Where events can be moved to archival storage, reducing storage scheme transitions can be of further benefit and speed access times of archived events.