Abstract: A method is used in managing storage space in storage systems. Storage space reserved by a storage object from a set of storage tiers is evaluated. A data storage system includes the first and second storage tiers configured such that performance characteristics associated with the first storage tier is different from the second storage tier. Based on the evaluation, storage space available and consumed in each storage tier of the set of storage tiers is determined.

Abstract: Embodiments of the present disclosure relate to a method, a device, and a computer program product for processing data. The method includes: loading, at a switch and in response to receipt of a model loading request from a terminal device, a data processing model specified in the model loading request. The method further includes: acquiring model parameters of the data processing model from the terminal device. The method further includes: processing, in response to receipt of to-be-processed data from the terminal device, the data using the data processing model based on the model parameters. Through the method, data may be processed at a switch, which improves the efficiency of data processing and the utilization rate of computing resources, and reduces the delay of data processing.

Abstract: Embodiments are described for storing array snapshots of a block-based system in networked storage, such as an NAS or SAN device. A system and process determines a size of the block device and splits it into a number of slices based on the size of the block device, with each slice comprising slice data. The slice data is written to protection storage either directly or through temporary buffer memory. The slice number and memory location for the slice data is stored in a key/value map, where the key comprises the slice number, and the value comprises the location. Backup agents are deployed to back up the slice data for each slice of the block device to the networked storage, and the slice data is stored as array snapshots in the network storage.

Abstract: A shaving device comprising a head assembly including a support member having at least one support member magnet and a blade cartridge having at least one face with at least one razor blade and configured to be rotatably coupled to the support member about a pivot axis. The blade cartridge includes at least one blade cartridge magnet having a pole aligned with a pole of the support member magnet to generate a magnetic force that urges the blade cartridge about the pivot axis towards an initial starting position (ISP), wherein the blade cartridge is further configured to rotate about the pivot axis away from the ISP upon application of an external force sufficient to overcome the magnetic force between the support member magnet and the blade cartridge magnet.

Abstract: A shaving device comprising a head assembly including a support member having at least one support member magnet and a blade cartridge having at least one face with at least one razor blade and configured to be rotatably coupled to the support member about a pivot axis. The blade cartridge includes at least one blade cartridge magnet having a pole aligned with a pole of the support member magnet to generate a magnetic force that urges the blade cartridge about the pivot axis towards an initial starting position (ISP), wherein the blade cartridge is further configured to rotate about the pivot axis away from the ISP upon application of an external force sufficient to overcome the magnetic force between the support member magnet and the blade cartridge magnet.

Abstract: Described is hard link handling when a directory snapshot exists that includes the hard link's connected file object. A hard link is created by allocating a virtual inode number for the hard link, with the virtual inode number mapped to a real inode number that identifies a real inode of the file object; the hard link is assigned weight. A total weight associated with the real inode is increased by the hard link weight, and a hard link data store is updated with an entry for the hard link. Upon receiving data write request to the hard link, weight data determines that the file object is shared as a result of the snapshot; the hard link is disassociated from the real inode file, and associated with a new real inode number and new real inode of a new file object. The data is written based on the new real inode.

Abstract: Techniques for managing sequencing requests for storage node operations based on types of operations being sequenced. The techniques manage sequencing requests for different types of operations, such as backup and recovery operations, replication operations, migration operations, and so on, in a manner that avoids overwhelming storage node capacity. The techniques include receiving a sequencing request for an operation of a specified operation type at a request manager of a storage node and determining whether a capacity of the storage node is available for running the operation by a capacity manager for the specified operation type, in which the capacity manager is provided by a storage client and implemented on the storage node separate from the request manager. In this way, throttling, limiting, and/or prioritization requirements of the operation of the specified operation type can be defined by the storage client in a manner agnostic to the request manager.

Abstract: Aspects of the present disclosure relate to enabling storage array-based remote replication from containerized applications operating on one or more node clusters. In embodiments, a host executing one or more operations from a node cluster is provided an interface (e.g., an application programming interface (API)) to a storage array. Additionally, the host can be delivered resources to manage and monitor the storage array to perform one or more data replication services directly from the node cluster and via the interface. Further, data replications services are triggered in response to instructions issued by the host directly from the node cluster and via the interface.

Abstract: Aspects of the present disclosure relate to data deduplication (dedup) techniques for storage arrays. In embodiments, a sequence of input/output (IO) operations in an IO stream received from one or more host devices by a storage array are identified. Additionally, a determination can be made as to whether a set of previously received IO operations match the identified IO sequence based on a time series relationship between the identified IO sequence and the previously received IO operations. Further, one or more data deduplication (dedup) techniques can be performed on the matching IO sequence.

Abstract: One example method includes, for each document in a group of annotated documents, extracting a set of words from the annotated document, and each of the words is positioned in a respective field of the annotated document. The method further includes using an aggregation function to determine, for one of the fields, a similarity of each one of the annotated documents to all of the other annotated documents, creating a document layout graph with nodes that each correspond to a respective annotated document, and each node is connected to all other nodes for which a similarity threshold for the one field has been met, and running an algorithm on the document layout graph to identify a clique of the annotated documents, and each annotated document in the clique has a similar layout to respective layouts of the other annotated documents in the clique.

Abstract: Systems and methods for backing up data are provided. Data objects or blocks of data can be encrypted with individualized keys. The keys are generated from the unencrypted data objects or blocks. The encrypted data objects or blocks and fingerprints of the encrypted data objects or blocks can be uploaded to a datacenter. Even though the data objects or blocks are encrypted, deduplication can be performed by the datacenter or before the data object is uploaded to the datacenter. In addition, access can be controlled by encrypting the key used to encrypt the data object with access keys to generate one or more access codes. The key to decrypt the encrypted data object is obtained by decrypting the access code.

Abstract: On-the-fly point-in-time recovery operations are disclosed. During a recovery operation, the PiT being restored can be changed on-the-fly or during the existing recovery operation without restarting the recovery process from the beginning. In one example, this improves recovery time operation (RTO) and prevents aspects of the recovery operation to be avoided when changing to a different PiT.

Abstract: A method comprising: stopping to use one or more first approximate membership filters for servicing of read requests that are incoming to a storage system; increasing a size of a set of first data structures that are available in the storage system, each of the first data structures being used by the storage system for write request amortization; replacing the one or more first approximate membership filters with one or more second approximate membership filters, and building each of the one or more second approximate membership filters by: freezing all non-empty first data structures in the set, and copying respective contents of each of the frozen non-empty first data structures into any of the one or more second approximate membership filters; and starting to use the one or more second approximate membership filters for servicing of read requests that are incoming to the storage system.

Abstract: Trocar retractor apparatus and methods for use are described where an apparatus for positioning an instrument may generally include a substrate having a first surface and a second surface opposite to the first surface, an instrument positioning guide projecting from the first surface of the substrate, and one or more suction assemblies positioned along the second surface and in fluid communication with an interior of the substrate. The one or more suction assemblies may be attachable to a tissue region via a vacuum force applied through the one or more suction assemblies. The apparatus may also have the substrate configured to maintain a predetermined configuration when the vacuum force is applied.

Abstract: A method for generating a thread queue, that includes obtaining, by a user space file system, central processing unit (CPU) socket data, and based on the CPU socket data, generating a plurality of thread handles for a plurality of cores, ordering the plurality of thread handles, in the thread queue, for a first core of the plurality of cores, and saving the thread queue to a region of shared memory.

Abstract: A method for managing data includes obtaining, by a service function chain (SFC) orchestrator, a SFC request for a SFC, wherein the SFC comprises at least one virtual network function (VNF) and one service, in response to the SFC request: determining a set of candidate local data systems (LDSs) based on a resource availability mapping, performing a LDS analysis on the set of candidate LDSs, based on the LDS analysis: assigning the VNF to a candidate LDS of the set of candidate LDSs, assigning the service to a second LDS of the set of candidate LDSs, and based on the assigning of the VNF and the assigning of the service, initiating a deployment of the VNF and the service.

Abstract: Techniques described herein relate to a method for distributed data management. The method may include obtaining data descriptors for an application executing on a data host, performing a dataset policy analysis using the data descriptors to determine a data placement for a dataset associated with the application using a global name repository, performing, based on the data policy analysis, the data placement, and based on the data placement, updating the global name repository.

Abstract: Embodiments for providing end-to-end automated contextual and differentiated application level replication by dynamically creating replication profiles for asynchronous or synchronous replication at runtime to maintain any relevant service level agreement requirements. Based on relevant operating information, data sources are identified as critical and non-critical servers and their data is tagged accordingly in the replication application by using an analytics engine. The information and tags are used to produce a trained model for machine learning processes that can generated predictions for future replication operations. An error handler identifies erroneous predictions and provides a fallback mechanism to avoid any customer replication service level agreement breach at any given time.

Abstract: At least one processing device comprises a processor and a memory coupled to the processor. The at least one processing device is configured to establish one or more groups of synchronization objects in a storage system based at least in part on object type, and for each of the one or more groups, to insert entries into a corresponding object type queue for respective objects of the group, to execute a monitor thread for the group, the monitor thread being configured to scan the entries of the corresponding object type queue, and responsive to at least one of the scanned entries meeting one or more designated conditions, to take at least one automated action for its associated object. The synchronization objects illustratively comprise respective locks, or other objects. The at least one processing device illustratively comprises at least a subset of a plurality of processing cores of the storage system.

Abstract: A method and system for stream optimized backups to a cloud object store. When considering data protection, many prominent applications engage in backup operations by streaming their respective data to the cloud; however, the stream(s) is/are often ill-optimized (e.g., non-uniform data rates, non-uniform block sizes, different backup types, non-uniform data types or formats, etc.) to be written into cloud storage. The disclosed method and system, accordingly, propose a dynamic framework through which any arbitrary backup stream may be optimized according to the profile of any specific cloud-based object data store.