Patent classifications
G06F3/0646
Presentation of direct accessed storage under a logical drive model
In accordance with embodiments disclosed herein, there are provided methods, systems, mechanisms, techniques, and apparatuses for presentation of direct accessed storage under a logical drive model; for implementing a distributed architecture for cooperative NVM Data protection; data mirroring for consistent SSD latency; for boosting a controller's performance and RAS with DIF support via concurrent RAID processing; for implementing arbitration and resource schemes of a doorbell mechanism, including doorbell arbitration for fairness and prevention of attack congestion; and for implementing multiple interrupt generation using a messaging unit and NTB in a controller through use of an interrupt coalescing scheme.
Efficient Storage Device Upgrades
Modifying storage distribution in a storage system that includes one or more storage devices, including: detecting, for a storage device among the one or more storage devices, that a storage capacity of the storage device is different from a storage capacity of another storage device of the one or more storage devices, and responsive to detecting that the storage capacity for the storage device is different from the storage capacity of the other storage devices of the one or more storage devices, modifying a distribution of shards of data for a data stripe among the one or more storage devices.
FAST RESYNCHRONIZATION OF A MIRRORED AGGREGATE USING DISK-LEVEL CLONING
Systems and methods for performing a fast resynchronization of a mirrored aggregate of a distributed storage system using disk-level cloning are provided. According to one embodiment, responsive to a failure of a disk of a plex of the mirrored aggregate utilized by a high-availability (HA) pair of nodes of a distributed storage system, disk-level clones of the disks of a healthy plex may be created external to the distributed storage system and attached to the degraded HA partner node. After detection of the cloned disks by the degraded HA partner node, mirror protection may be efficiently re-established by assimilating the cloned disks within the failed plex and then resynchronizing the mirrored aggregate by performing a level-1 resync of the failed plex with the healthy plex based on a base file system snapshot of the healthy plex. In this manner, a more time-consuming level-0 resync may be avoided.
Isolation of protection functions in electrical power systems
Systems, devices, and methods include protection functions in an electrical power system. A processing subsystem may include a processor. A memory subsystem may comprise a first memory section and a second memory section. A memory management subsystem may, in a first operational mode, enable memory access between the processor and the first memory section and the second memory section and, in a second operational mode, enable memory access between the processor and only the first memory section.
RAID protection updates based on storage system reliability
A system, method, and product for flexible RAID layouts in a storage system, including: determining a reliability of an individual storage device of a plurality of storage devices, the individual storage device containing a plurality of portions of a Redundant Array of Independent Disks (RAID) stripe in a storage system, wherein the RAID stripe includes user data and inter-device parity data; detecting a change in the reliability of the individual storage device that contains the portion corresponding to the RAID stripe; and changing an amount of intra-device protection corresponding to the RAID stripe by decreasing, in the RAID stripe, an amount of space used to store the inter-device protection data.
Calculating capacity utilization in a storage system
Attributing consumed storage capacity among entities storing data in a storage array includes: identifying a data object stored in the storage array and shared by a plurality of entities, where the data object occupies an amount of storage capacity of the storage array; and attributing to each entity a fractional portion of the amount of storage capacity occupied by the data object.
RELEASING SPACE ALLOCATED TO A SPACE EFFICIENT TARGET STORAGE IN A COPY RELATIONSHIP WITH A SOURCE STORAGE
Provided are a computer program product, system, and method for releasing space allocated to a space efficient target storage in a copy relationship with a source storage. Source and target copy relationships indicate source data in the source storage to copy to target data in the target storage. The source copy relationship indicates source data that need to be copied to the target data before being updated, and the target copy relationship indicates target data tracks updated with data copied from corresponding source data. An operation is initiated that results in terminating the source and target copy relationships. Space allocated to the target data for the source and target copy relationships is released in response to determining that the target storage comprises the space efficient storage. The source and target copy relationships are removed.
EFFICIENT EXPORT SCHEDULING USING INDEX AND SCHEMA TO DETERMINE DATA DISTRIBUTION
In one embodiment, a method includes determining a data record partition size based on resources used for transferring data from a higher storage tier to one or more lower storage tiers. The method also includes determining which data records stored to the higher storage tier are suitable for export to the one or more lower storage tiers, determining a distribution mapping of the first memory, the distribution mapping indicating a relative distribution of storage locations for all of the data records that are stored to the higher storage tier, identifying all sets of contiguously stored data records on the higher storage tier that are suitable for export and greater in size than the data record partition size, logically sorting, in a descending order of size, the sets of contiguously stored data records, and sending a list of logically sorted sets of contiguously stored data records to an exporter.
Apparatus and method for accelerating operations in a processor which uses shared virtual memory
An apparatus and method are described for coupling a front end core to an accelerator component (e.g., such as a graphics accelerator). For example, an apparatus is described comprising: an accelerator comprising one or more execution units (EUs) to execute a specified set of instructions; and a front end core comprising a translation lookaside buffer (TLB) communicatively coupled to the accelerator and providing memory access services to the accelerator, the memory access services including performing TLB lookup operations to map virtual to physical addresses on behalf of the accelerator and in response to the accelerator requiring access to a system memory.
MODEL PARAMETER COMBINATION METHOD AND APPARATUS
The method and apparatus that are applied to a machine learning system which includes at least one parameter collection group and at least one parameter delivery group. Each parameter collection group is corresponding to at least one parameter delivery group. The method includes: when any parameter collection group meets an intra-group combination condition, combining model parameters of M nodes in the parameter collection group to obtain a first model parameter of the parameter collection group, where a smallest quantity s of combination nodes in the parameter collection groupMa total quantity of nodes included in the parameter collection group; and sending the first model parameter of the parameter collection group to N nodes in a parameter delivery group corresponding to the parameter collection group, where 1Na total quantity of nodes included in the parameter delivery group corresponding to the parameter collection group.