Abstract: Storage of data according to mapped reliability groups (MRGs) of mapped redundant arrays of independent nodes (mapped clusters) is disclosed. Real reliability groups (RRGs) of a real cluster can provide compartmentalization that can reduce a probability of a data loss event occurring in a cluster storage system. MRGs for a mapped cluster employing the RRGs of the real cluster can provide additional compartmentalization that can further reduce a probability of a data loss event occurring. A data protection set can be stored according to a first group of MRGs and a redundant representation of the data protection set can be stored according to a second group of MRGs, wherein a network distance between the first and second group of MRGs is greater than a network distance between constituent MRGs of either the first or second group of MRGs.

Abstract: A method is used in managing truncation of files of file systems. A request is received to delete a portion of a file of a file system. The file system includes a plurality of files. Metadata of the file is evaluated for determining a number of file system blocks associated with the portion of the file that are available for de-allocation. Storage space associated with the file system blocks is reported as available storage space to a user of the file.

Abstract: One example method includes receiving, at a node of a data confidence fabric (DCF), a DCF backbone, installing the DCF backbone at the node, receiving a config file at the node, and the config file includes configuration information concerning the node, and receiving and installing a trust insertion component specified in the configuration information, where operation of the trust insertion component is enabled by the DCF backbone, and the trust insertion component is operable to associate trust metadata with data received by the node.

Abstract: Techniques are provided for multi-party prediction using feature contribution values. One method comprises obtaining a first set of feature contribution values associated with respective ones of a plurality of machine learning models, wherein each machine learning model is trained using training data of a different party and each feature contribution value indicates a contribution by a corresponding feature to a prediction generated by the associated machine learning model; training an aggregate machine learning model using the obtained first sets of feature contribution values; receiving a second set of feature contribution values generated by applying data of at least one party to at least one machine learning model; and applying the second set of feature contribution values to the trained aggregate machine learning model to obtain a global prediction.

Abstract: A method is used in analyzing a storage system using a machine learning system. Data gathered from information associated with operations performed in a storage system is analyzed. The storage system is comprised of a plurality of components. A bitmap image is created based on the gathered data, where at least one of the plurality of components is represented in the bitmap image. The machine learning system is trained using the bitmap image, where the bitmap image is organized to depict the plurality of components of the storage system.

Abstract: A method, computer program product, and computing system for receiving data for storage in a storage system. The data may be written to a head entry of a log buffer, wherein the log buffer includes a plurality of data entries for flushing to the storage system. At least a portion of the plurality of data entries of the log buffer may be flushed, via a plurality of threads, to the storage system based upon, at least in part, a tail entry of the log buffer. A queue of committed data entries may be updated, via each thread of the plurality of threads, with one or more data entries of the log buffer flushed to the storage system by each thread. A new tail entry of the log buffer may be determined, via a thread of the plurality of threads, based upon, at least in part, the queue of committed data entries.

Abstract: Methods and systems for managing data in a distributed system are disclosed. The distributed system may include devices used by users (e.g., clients) and devices in which data is stored for future accessibility (e.g., storage providers). A data storage system may manage the data for the clients. To manage the data efficiently, the data storage system may perform an integrated process of both verifying that segments of files believed to be stored are actually stored and segments of files that no longer need to be stored are removed. The process may not be performed in real-time as files that no longer need to be stored are identified (e.g., as deletion requests are received). Rather, the integrated process may employ a garbage collection process where deletion conditions for segments are checked intermittently over time, and files are verified.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for managing a storage system. The method includes: determining, at a first device of the storage system, whether a load of a first accelerator resource of the first device exceeds a load threshold; sending, if it is determined that the load exceeds the load threshold, a job processing request to a second device in a candidate device list to cause the second device to process a target job of the first device using a second accelerator resource of the second device, the candidate device list indicating devices in the storage system that can be used to assist the first device in job processing; receiving, from the second device, latency information related to remote processing latency of processing the target job using the second accelerator resource; and updating the candidate device list based on the latency information. The embodiments of the present disclosure can optimize the system performance.

Abstract: A method, computer program product, and computer system for identifying duplicate sectors in a block of a plurality of blocks. The duplicate sectors in the block may be zeroed out. A data reduction operation may be performed on the block after the duplicate sectors are zeroed out.

Abstract: Discovering environment objects for information management in a networked environment. Information management provides services such as data protection, backup, retention, compliance, etc., by classifying the objects and/or infrastructure of an entity according to its value to the entity. Information management begins by discovering the data in a network and by discovering the servers and services operating in a network. The servers and services are discovered using adapters that can collect information regarding the environment objects. Objects can be discovered using cascaded discovery, where the information collected by one adapter is used to drive the collection of additional information by other adapters. This information can then by used by information management systems to assign or orchestrate various services.

Abstract: According to one embodiment, a method identifies a plurality of parameters associated with one or more virtual machines to be backed up to a backup storage system and a number of available backup proxy sessions. The method further assigns each of the available backup proxy sessions to a virtual disk of the one or more virtual machines based on the plurality of parameters and the number of available backup proxy sessions. The method then initiates backup operations, wherein each assigned backup proxy session is to back up a corresponding virtual disk to which it is assigned.

Abstract: A method, computer program product, and computing system for receiving a selection of one or more secure snapshots to remove from a storage system. A snapshot deletion key may be received from the storage system. The selection of the one or more secure snapshots and the snapshot deletion key may be provided to a storage system support service. A snapshot deletion response may be received from the storage system support service. The snapshot deletion response and the selection of the one or more secure snapshots may be authenticated via the storage system. In response to authenticating the snapshot deletion response and the selection of the one or more secure snapshots, the one or more secure snapshots may be unlocked for deletion.

Abstract: The present disclosure relates to a method, device and product for managing a plurality of users of an application system. According to example implementations of the present disclosure, a method is provided for managing a plurality of users of an application system. In the method, a group of users matching a search keyword from a requester user are determined among the plurality of users, the search keyword comprising at least one part of an identifier of a desired user. A requester layer of the requester user is determined in a tree structure comprising hierarchical relations among the plurality of users. A group of layers of the group of users are determined in the tree structure, respectively. The group of users are sorted based on the requester layer and the group of layers. With example implementations of the present disclosure, a user which the requester user is looking for may be sorted at a top place so as to be selected by the requester user.

Abstract: Phased parameterized combinatoric testing for a data storage system is disclosed. A testing recipe can be performed according to different input arguments. Combinatoric testing of the data storage system can be based on different combinations of operations and arguments. The disclosed testing can employ a consistent integer index for arguments passed into the sequenced operations of the recipe. The recipe can be employed to generate a phased test tree that can enable testing based on a phase rather than loading an entire test suite into memory. The consistent integer index can be used to identify failed test cases such that the entire test can be reconstituted from stored failed test information. Distribution of test cases to worker process can based on the phased test tree to facilitate interning an operation. Stored failed test information can include human-readable failure information.

Abstract: A method, computer program product, and computing system for allocating a first number of tokens from a plurality of tokens for processing read IO requests from a read IO queue, thus defining a number of allocated read tokens. A second number of tokens may be allocated from the plurality of tokens for processing write IO requests from a write IO queue, thus defining a number of allocated write tokens. It may be determined that the processing of the write IO requests is throttled. In response to determining that the processing of the write IO requests from the write IO queue is throttled, a maximum allowable number of write tokens may be defined. Additional tokens may be allocated for processing the read IO requests from the read IO queue based upon, at least in part, the maximum allowable number of write tokens and the number of allocated write tokens.

Abstract: Methods, systems, and computer readable mediums for securely establishing credential data for a computing device are disclosed. According to one example, a method includes assigning, by a credential manager, credential set data to a computing device and mapping the credential set data to a device identifier key associated with the computing device in a credential data store accessible by the credential manager. The method further includes receiving, from a provisioning service client, a credential set request message including the device identifier key by the credential manager in response to an activation of the computing device at a customer location site and sending, by the credential manager to the provisioning service client, the credential set data for authenticating the computing device at the customer location site.

Abstract: A method, computer program product, and computing system for deploying a storage processor of a storage system as a target of a non-volatile memory express (NVMe) over fabric (NVMe-oF) network. One or more NVMe storage devices coupled to the storage processor may be identified, thus defining one or more local NVMe storage devices. A smart network interface card may be coupled to the NVMe-oF network. The smart network interface card may be provided with access to the one or more local NVMe storage devices via the NVMe-oF network.

Abstract: A method, computer program product, and computing system for associating a plurality of NVMe IO submission queues with an NVMe IO completion queue. An NVMe IO completion queue polling frequency may be defined for a plurality of threads configured to provide one or more IO requests to the plurality of NVMe IO submission queues. The NVMe IO completion queue may be polled based upon, at least in part, the NVMe IO completion queue polling frequency defined for the plurality of threads.

Abstract: An active layer of the index includes a first shard group, and shards in the first shard group are configured to store indexes of a part of data objects in a streaming storage system. In response to determining that the state of the first shard group meets a predetermined expansion condition, a second shard group is created in the index, and shards in the second shard group are configured to store indexes of data objects that will enter the storage system. The storage system is managed based on the shards in an active layer (where the second shard group is located) and frozen layers (where the second shard group) in the index. The number of shards in the storage system can be dynamically set to process streaming data at a relatively high speed, and it is suitable for processing streaming data that continuously enters the storage system.

Abstract: Techniques can be implemented to provide for antivirus scanning in clustered storage where not all nodes of the cluster are connected to an antivirus server. A first computing node of computing nodes of a computing cluster can determine a status of an antivirus server. The first computing node can send a first indication of the status of the antivirus server to a group management protocol service of the computing cluster. The group management protocol service can send a second indication of whether the first computing node is available for antivirus scanning to a job engine of the computing cluster. The job engine can distribute an antivirus job among the computing nodes based on whether the first computing node is available for the antivirus scanning.