Abstract: Various systems, methods and apparatuses for coordinating the sharing of cache data between cluster nodes operating on the same data objects. One embodiment involves a first node in a cluster receiving a request for a data object, querying a global lock manager to determine if a second node in the cluster is the lock owner of the data object, receiving an indication identifying the second node as the lock owner and indicating that the data object is available in the second node's local cache, requesting the data object from the second node, and then receiving the data object from the second node's local cache. Other embodiments include determining whether the lock is a shared lock or an exclusive lock, and either pulling the data object from the local node of the second cache or receiving the data object that is pushed from the second node, as appropriate.

Abstract: A computer-implemented method and a system for ensuring right-to-erasure compliance during data recovery are disclosed. The method may include intercepting a request to perform a recovery process to restore backup data, automatically comparing a backup image of requested data with a record of right-to-erasure orders, and determining, based on the comparison, that the backup image includes individual data related to at least one right-to-erasure order. The record of right-to-erasure orders may include at least one of an identity of an individual, at least one creation and/or execution date of a right-to-erasure order, and/or a list of backup images associated with a right-to-erasure order. The method may further include erasing the individual data to comply with the at least one right-to-erasure order, recording the erasure of the individual data in an audit log, and completing the recovery process for the requested data.

Abstract: Various systems and methods are provided for optimizing Storage Quality of Service (SQoS) by dynamically determining and managing queue depth and system capacity in a computer storage system. In one embodiment, this functionality includes determining a queue depth value for a given epoch, and then advertising that queue depth value to one or more applications. Upon receiving a number of I/O operations that does not exceed the advertised queue depth, the storage tier processes those I/O operations. The system then evaluates the system capacity in light of the current queue depth value and other variables, such as the observed (or “seen”) latency, to determine whether the optimal queue depth value has been reached. Until the optimal queue depth value has been reached, the process outlined above is repeatedly iteratively (with dynamically increasing queue depth values) in each ensuing epoch until the optimal queue depth value is determined.

Abstract: Various systems, methods, and processes for accelerating data access in application and testing environments are disclosed. A production dataset is received from a storage system, and cached in a consolidated cache. The consolidated cache is implemented by an accelerator virtual machine. A file system client intercepts a request for the production dataset from one or more application virtual machines, and transmits the request to the accelerator virtual machine. The accelerator virtual machine serves the production dataset to the one or more application virtual machines from the consolidated cache.

Abstract: Disclosed herein are methods, systems, and processes to track access patterns of inodes, and to issue read-ahead instructions to pre-fetch inodes into memory. A location of a unit of metadata in a metadata storage area is determined. Another location in the metadata storage area that corresponds to a current metadata read operation is determined. Whether a metadata read-ahead operation can be performed is determined using the location of the unit of metadata and the another location. In response to a determination that the metadata read-ahead operation can be performed, the metadata-ahead operation is issued.

Abstract: The disclosed computer-implemented method for managing quality of service may include (i) providing, in a network storage environment, a quality of service engine to regulate network traffic by assigning three separate factors to applications that are consuming a network resource, (ii) adding, to a configuration of the quality of service engine, a fourth priority factor that establishes two tiers of priority among applications that generate traffic that is regulated by the quality of service engine, and (6) regulating, by the quality of service engine based on the fourth priority factor, network traffic in the network storage environment by providing access to the network resource to an application assigned a higher priority over another application assigned a lower priority such that the fourth priority factor enables the quality of service engine to adhere to a service level agreement. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for distributing cache space may include (i) identifying workloads that make input/output requests to a storage system that comprises a cache that stores a copy of data recently written to the storage system, (ii) calculating a proportion of the cache that is occupied by data written to the cache by a workload, (iii) determining that the proportion of the cache that is occupied by the data written to the cache by the workload is disproportionate, and (iv) limiting the volume of input/output requests from workload that will be accepted by the storage system in response to determining that the proportion of the cache that is occupied by the data written to the cache by the workload is disproportionate. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for efficient archiving of related electronic messages may include (1) receiving, at a message archiving system, a corpus of electronic messages from one or more servers, where at least a portion of the electronic messages in the corpus represents electronic messages that are related to each other, (2) processing the corpus of electronic messages into groups of related electronic messages, where each group of the related electronic messages is associated with a message identifier, and (3) archiving, by the message archiving system, each group of related electronic messages as a corresponding unified archive item. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for maintaining cache coherency may include (1) receiving an indication of a revocation of a grant to an owner node of a shared lock for a data object owned by the owner node; (2) invalidating, in response to the indication of the revocation, a copy of the object in a local cache of the owner node; (3) receiving, while the requesting node holds a grant of an exclusive lock, a request from the requesting node to update the object in the local cache; (4) transmitting, in response to the request to update the object, a request for a shared lock for the object; (5) receiving an indication of a grant of the shared lock; and (6) updating, in response to the grant of the shared lock, the object in the local cache. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method to create a version map to represent the data state of a file at a particular point in time when an incremental backup is performed. In one embodiment, a logical memory backup file is created that is known as a cumulative data file. Changes to the cumulative data file according to one embodiment of the present invention include appending copies of modified data when the modified data meets a certain condition. A new version map may be created each time an incremental backup occurs. Locations of both modified and unmodified data in the backup data file are mapped for future reference to the data.

Abstract: The disclosed computer-implemented method for categorizing electronic messages for compliance reviews may include (1) identifying, as part of a compliance review for an organization, an uncategorized electronic message sent or received by a supervised user within the organization, (2) comparing the uncategorized electronic message with information gathered from previously categorized electronic messages sent or received by supervised users within the organization, (3) determining, based at least in part on the comparison, a relevance level of the uncategorized electronic message with respect to the compliance review, (4) receiving, from a compliance reviewer, feedback indicating whether the determined relevance level is correct, and (5) updating the previously gathered information based on the feedback from the compliance reviewer. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed herein are methods, systems, and processes to share data storage-related services between multiple deduplication systems. A determination is made as to whether a shared file that exists in a library of shared files corresponds to a local file. In response to a determination that the shared file exists in the library of shared files, the local file is virtually segmented into data segments, and local virtual mapping metadata is generated based, at least in part, on the data segments. The local virtual mapping metadata is then stored.

Abstract: The disclosed computer-implemented method for caching in an erasure-coded system may include partitioning data into data chunks and storing the data chunks across at least two data storage devices. The method may also include encoding the data chunks into at least one parity chunk and storing the at least one parity chunk on at least one parity storage device. The method may further include caching (parity and/or data functions) to at least one storage device, when a threshold value is reached. The method may include detecting a storage failure on one of the data storage devices and subsequent thereto, prioritizing the caching of certain functions over those of others. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for culling search results in electronic discovery may include (1) identifying a data source that is subject to electronic discovery in connection with a lawsuit, (2) mining metadata of a plurality of files within the data source to generate metadata derivatives that describe non-content-based attributes of the files, (3) creating an index that groups the files into a plurality of categories representative of the metadata derivatives, (4) receiving, from a user involved in the electronic discovery, user input that specifies a subset of the categories within the index and a keyword, (5) searching the subset of categories within the index for a subset of the files whose contents include the keyword, and (6) providing, to the user, a result of the search that identifies the subset of files whose contents include the keyword. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed herein are methods, systems, and processes to perform application aware input/output (I/O) fencing operations. Performing such an application aware I/O fencing operation includes installing an identifier that identifies an instance of an application with a node on which the instance of the application is executing, on coordination points. A weight assigned to the instance of the application is determined, and the instance of the application is terminated based on the weight.

Abstract: Disclosed herein are methods, systems, and processes to secure internal services in a distributed computing environment. A service packet that includes a service call from a source appliance is intercepted at a server. A determination is made that the service call is for an internal service provided by the source appliance and includes client information with client process properties. The service packet is demultiplexed. A determination is made that rule attributes associated with the internal service match the client process properties. The client information is removed from the service packet and the service call is forwarded to the server.

Abstract: A method for grouping backup images in deduplication groups is described. In one embodiment, the method includes identifying a new backup image, obtaining metadata from one or more nodes in the new backup image, and comparing the metadata from the one or more nodes in the new backup image with information from one or more nodes in a backup image from a first deduplication group. Each of the one or more nodes include at least in part a file or a directory. The first deduplication group is one group from a plurality of deduplication groups.

Abstract: Disclosed herein are methods, systems, and processes to perform hierarchical fencing in clustered environments. A first set of registration keys is received from a first set of nodes that are supported by a first hypervisor and are part of a cluster. A first key value is generated based on the first set of registration keys. The first key value is then stored on a shared storage device shared by the first set of nodes and a second set of nodes supported by a second hypervisor. Upon receiving a request to perform an input/output (I/O) fencing operation, the first key value is modified and the second key value is removed from the shared storage device.

Abstract: A computer-implemented method for increasing restore speeds of backups stored in deduplicated storage systems may include (1) identifying a backup that includes data stored in at least one data container within a deduplicated storage system, (2) detecting a subsequent backup that includes additional data, (3) calculating an amount of duplication between the additional data included in the subsequent backup and the data stored in the data container, (4) determining that the amount of duplication between the additional data and the data stored in the data container is below a predetermined threshold, (5) identifying at least one additional data container to store the additional data instead of deduplicating the additional data with respect to the data container, and then (6) storing the additional data in the additional data container to facilitate increasing a restore speed of the subsequent backup. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method for flushing data in a virtual computing environment is provided. The method includes writing application output from an application spanning one or more virtual machines to a cache, wherein each virtual machine is implemented using one or more compute nodes and the cache is implemented in storage associated with the one or more compute nodes. In an effort to flush data associated with application writes more efficiently from the cache to a local backing store or one or more data nodes, the method may include generating a mapping of each of the plurality of application writes. The method may further include sorting sets of one or more virtual disks based upon an offset of each application write as indicated in the mapping. In addition, a storage virtualizer may cancel duplicate application writes, merge multiple contiguous application writes, and merge multiple epochs prior to flushing the data.