Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.

Abstract: Methods and systems for executing an application by a computing device are provided. One method includes generating an operating policy for a processor executable application based on a licensing term; associating an identifier for storing the operating policy in a data structure external to the application; providing the operating policy to the application using an application programming interface (API) for controlling execution of the application; and executing the application using the operating policy.

Abstract: A computer implemented method for updating a file system tree structure through an atomic operation, comprising one or more hardware processor adapted for designating a file system comprising a plurality of files arranged in a plurality of tree structures, the file system is based on a direct mapping persistent memory, receiving instructions from a client to alter an altered file of the plurality of files, creating an alternate tree structure to apply the alteration in case the alteration involves a non-atomic tree structure operation to an original tree structure of the plurality of tree structures containing the altered file and committing the alteration to the file system through an atomic operation.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices providing an application centric view of storage within a network storage system, which include: creating an application instance, by the network storage system, wherein the application instance comprises at least one application-component determined based on application configuration information of the application instance; tracking the application configuration information of the application; and displaying the application configuration information in view of the storage within the network storage system.

Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.

Abstract: Techniques are provided for multi-tier write allocation. A storage system may store data within a multi-tier storage environment comprising a first storage tier (e.g., storage devices maintained by the storage system), a second storage tier (e.g., a remote object store provided by a third party storage provider), and/or other storage tiers. A determination is made that data (e.g., data of a write request received by the storage system) is to be stored within the second storage tier. The data is stored into a staging area of the first storage tier. A second storage tier location identifier, for referencing the data according to a format utilized by the second storage tier, is assigned to the data and provided to a file system hosting the data. The data is then destaged from the staging area into the second storage tier, such as within an object stored within the remote object store.

Abstract: Direct monitoring of a plurality of storage nodes in a primary cluster is performed based on connectivity with the storage nodes. Indirect monitoring of a first storage node is performed, in response to direct monitoring of the first storage node indicating failure of the connectivity with the first storage node, wherein a second storage node of the plurality of nodes is a backup node for the first storage node. The indirect monitor of the first storage node indicates failure of the first storage node in response to performance of storage access operations by the second storage node that were previously performed by the first storage node. A cluster-switch operation is initiated to switch to from the primary cluster to a backup cluster based on an occurrence of at least one cluster-failure condition that comprises the indirect monitor of the first storage node indicating failure of the first storage node.

Abstract: A storage tier manager creates different representations of a dataset backup for different retention periods. Each of the representations of the dataset backup is distinctly identifiable despite initially representing a same dataset backup. The representations are structured metadata corresponding to the dataset backup. One representation is a cached backup version of the dataset backup (“cached backup” or “cached representation”) provided for low latency access while residing at a storage tier of the backup appliance for a relatively short retention period according to a lifecycle management policy. The other representation is a cloud backup version of the dataset backup (“cloud backup” or “cloud representation”) provided for persisting into cloud storage for a longer retention period according to the lifecycle management policy.

Abstract: In addition to caching I/O operations at a host, at least some data management can migrate to the host. With host side caching, data sharing or deduplication can be implemented with the cached writes before those writes are supplied to front end storage elements. When a host cache flush to distributed storage trigger is detected, the host deduplicates the cached writes. The host aggregates data based on the deduplication into a “change set file” (i.e., a file that includes the aggregation of unique data from the cached writes). The host supplies the change set file to the distributed storage system. The host then sends commands to the distributed storage system. Each of the commands identifies a part of the change set file to be used for a target of the cached writes.

Abstract: Exemplary embodiments provide methods, mediums, and systems for efficiently moving data between cluster nodes. Upon receiving a request to read or write data at a first cluster node that is in communication with a client, the first node effects the transfer to or from a second cluster node. The transfer is carried out using a combination of remote data memory access (“RDMA”), or a similar technique that bypasses a part of the network stack, and transport control protocol (“TCP”), or a similar technique that does not bypass a part of the network stack. The data is transferred using RDMA, while certain control messages are sent using TCP. By combining RDMA content transfers and TCP control messages, data transfers can be carried out faster, more efficiently, and with less processing overhead. Other embodiments are described and claimed.

Abstract: Technology is disclosed for bridging clouds of computing devices for compute and data storage. The technology can receive a virtual routing table (VRT), wherein the VRT indicates an association with a virtual local area network (VLAN) and defines neighbors for each route wherein at least one neighbor is defined for each of the two different cloud service providers, wherein the route definition creates a private transitive network between the neighbors; receive from a first node a first message destined for a second node; determine that the first message employs the route specified by the VRT; forward the first message to the second node; receive from a third node a second message destined for the second node; determine that the second message does not employ the route specified by the VRT; and fail to forward the second message to the second node.

Abstract: Methods and systems for dynamic hashing in cache sub-systems are provided. The method includes analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data, where for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value.

Abstract: One or more techniques and/or computing devices are provided for managing an arbitrary set of storage items using a granset. For example, a storage controller may host a plurality of storage items and/or logical unit numbers (LUNs). A subset of the storage items are grouped into a consistency group. A granset is created for tracking, managing, and/or providing access to the storage items within the consistency group. For example, the granset comprises application programming interfaces (APIs) and/or properties used to provide certain levels of access to the storage items (e.g., read access, write access, no access), redirect operations to access either data of an active file system or to a snapshot, fence certain operations (e.g., rename and delete operations), and/or other properties that apply to each storage item within the consistency group. Thus, the granset provides a persistent on-disk layout used to manage an arbitrary set of storage items.

Abstract: A method and system for server fault analysis are described. A server configuration analyzer retrieves event logs collected from a server with a fault such as a misconfiguration. These event logs can then be analyzed using metrics to identify one or more messages in the logs that indicate a cause of the fault on the server. Once the messages are identified, the server configuration analyzer retrieves remedial commands that may be used to correct the fault from a database that stores remedial commands correlated with event log messages. The server configuration analyzer can then present the messages and remedial commands to a user to assist with identifying the cause of the fault and correcting it.

Abstract: Methods and systems for a networked computing system are provided. One method includes generating, based on a first topology, a first proxy endpoint by a first device of a first pluggable compute module; establishing a communication tunnel between the first proxy endpoint and a non-volatile memory express (NVMe) storage device for peer-to-peer communication between the first proxy endpoint of the first device and a controller of the NVMe storage device. An NVMe translation module receives a request for the NVMe storage device from the first proxy endpoint and the NVMe translation module translates the request to an NVMe request for the NVMe storage device for accessing storage space at the NVMe storage device. The method further includes de-allocating the first proxy endpoint, when the first topology is deactivated making the first pluggable compute module and the NVMe storage device available for a second topology.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently administering locks for shared resources, such as data blocks, stored on a storage system. Methods for stamping a plurality of computer data objects are disclosed which include: accessing at least one of the plurality of computer data objects by a first data thread; assigning, by the first data thread, a stamp to the at least one of the plurality of computer data objects, to signify the at least one of the plurality of computer data objects is associated with the first data thread; preventing subsequent access by a second data thread to the stamped at least one of the plurality of computer data objects; and determining the stamp is no longer active, upon an event, effectively releasing the at least one of the plurality of computer data objects.

Abstract: A method, non-transitory computer readable medium, and device that assists with sharing non-volatile memory solid state drives across a cluster group includes receiving a request for a block of storage in a non-volatile memory solid state drive in one of the plurality of non-volatile memory disk shelves. Information associated with each of a plurality of solid state drives in the plurality of non-volatile memory disk shelves associated with the received request is obtained. A namespace for each of the plurality of solid state drives in the plurality of non-volatile memory disk shelves using the obtained information is created. The requested block of storage in the non-volatile memory solid state drive associated with one of the created namespace is assigned to the requesting client computing device.

Abstract: Methods and systems for a networked storage system are provided. A provisioning engine assigns a plurality of performance parameters in response to a provisioning request for provisioning a workload for storing data in a networked storage environment; identifies a demand for a plurality of resources of the networked storage environment for meeting the provisioning request, transforms historical available performance capacity by filtering any historical performance capacity data related to any transient event; and identifies at least a resource pair that can meet the identified demand based on the transformed historical performance capacity data.

Abstract: Methods, non-transitory computer readable media, and computing devices that facilitate secure cloud compute environments are disclosed. A secure application package (SAP) is encrypted with an SAP encryption key. The encrypted SAP is stored on cloud storage. A profiling bitstream is sent to a cloud provider. The profiling bitstream is configured to, when implemented by the HLD, generate and return a profile response, including a bitstream encryption key, which is encrypted with a public key. The profile response is decrypted using a private key and the bitstream encryption key is extracted. An application bitstream is sent to the cloud provider. The application bitstream is encrypted with the bitstream encryption key, includes the SAP encryption key, and is configured to, when implemented by the HLD, obtain the SAP from the cloud storage, decrypt the SAP using the SAP encryption key, and execute an application in a softcore included in the application bitstream.

Abstract: A method, apparatus and product for accelerating concurrent access to a file in a memory-based file system. The method comprising receiving a request issued by a program, for accessing a file stored in a memory-based file system; and subject to the request being associated with data modification of data within the file, and subject to the modification not necessitating change in a structure of a data structure used for content lookup for the file, acquiring a lock to the file to the program, wherein the lock is acquired in a shared mode.