Abstract: Disclosed herein are methods, systems, and processes to provide coherency across disjoint caches in clustered environments. It is determined whether a data object is owned by an owner node, where the owner node is one of multiple nodes of a cluster. If the owner node for the data object is identified by the determining, a request is sent to the owner node for the data object. However, if the owner node for the data object is not identified by the determining, selects a node in the cluster is selected as the owner node, and the request for the data object is sent to the owner node.

Abstract: Provided computer-implemented methods for prioritizing cache objects for deletion may include (1) tracking, at a computing device, a respective time an externally-accessed object spends in an external cache, (2) queuing, when the externally-accessed object is purged from the external cache, the externally-accessed object in a first queue, (3) queuing, when an internally-accessed object is released, the internally-accessed object in a second queue, (4) prioritizing objects within the first queue, based on a cache-defined internal age factor and on respective times the objects spend in the external cache and respective times the objects spend in an internal cache, (5) prioritizing objects within the second queue based on respective times the objects spend in the internal cache, (6) selecting an oldest object having a longest time in any of the first queue and the second queue, and (7) deleting the oldest object. Various other methods, systems, and computer-readable media are disclosed.

Abstract: Disclosed herein are methods, systems, and processes to provide coherency across disjoint caches in clustered environments. It is determined whether a data object is owned by an owner node, where the owner node is one of multiple nodes of a cluster. If the owner node for the data object is identified by the determining, a request is sent to the owner node for the data object. However, if the owner node for the data object is not identified by the determining, selects a node in the cluster is selected as the owner node, and the request for the data object is sent to the owner node.

Abstract: The disclosed computer-implemented method for write-once-read-many storage may include (1) receiving, at a file system on the computing device, a request to assign a write-once-read-many (WORM) attribute to a file, wherein the request is received from an application, (2) setting, in response to the request to assign the WORM attribute to the file, a WORM flag in an extended attribute associated with the file, and (3) associating with the file, in response to the setting of the WORM flag, a retention period attribute and read-only access until the end of the retention period. The provided systems and methods may provide per-file WORM support at a file system level using extended attributes of the file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for the tracking of access patterns of inodes, and the issuing of inode read-ahead instructions, in order to pre-fetch inodes. Such a method can include, for example, identifying a unit of metadata in a file system, identifying a file system structure in the file system, determining whether a file structure of the file system structure is non-sequential, and, in response to a determination that the file structure is non-sequential, retrieving a list of units of metadata. In such embodiments, the file system structure is associated with the unit of metadata, and the determining includes accessing the file system structure. Further, in certain embodiments, the units of metadata identified in the list of units of metadata are stored in a storage device of the computer system.

Abstract: Various systems and methods are provided for using various in-core and on-disk data structures to improve the file creation process through the use of previously-occupied inodes. For example, one method involves updating an in-core data structure in response to receiving a command to delete a first file, such that a first node is assigned to the first file, the in-core data structure is stored in a non-persistent computer-readable storage medium, the in-core data structure comprises a plurality of entries, each of the entries comprises information identifying a respective inode of a plurality of inodes as being available, and the updating the in-core data structure comprises storing information regarding the first inode in a first entry of the plurality of entries; and creating a second file, where the creating comprises assigning the first inode to the second file using the information regarding the first inode stored in the first entry.

Abstract: Methods and the like according to the disclosure can include determining an information type of digital information, writing the digital information using a first process (in response to a determination that the information type of the digital information is a first information type), and, in response to a determination that the information type of the digital information is a second information type, determining erasure-coded parity information for the digital information and writing the digital information using a second process (where the digital information is to be written to erasure-coded storage). In the former case, the first process that includes writing the digital information to storage. The second process includes writing the digital information and the erasure-coded parity information to erasure-coded storage, without writing the digital information to a log.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for improved write performance in erasure-coded storage systems in an efficient and effective manner. These can include identifying a data segment, identifying metadata, persisting the data segment to a storage system, storing the metadata in the journal, and persisting the metadata to the storage system. In such embodiments, the metadata is associated with the data segment by virtue of the metadata comprising a fingerprint of the data segment. Further, in such embodiments, the persisting the data segment to the storage system is performed without storing the data segment in a journal, and the storage system is an erasure-coded storage system.

Abstract: The disclosed computer-implemented method for storage block replication in a hybrid storage environment may include receiving a request associated with a data source being replicated to modify a cloud object, storing an instruction for modifying the cloud object, determining that a replication operation for the source has completed, and modifying the cloud object and deleting the instruction for modifying the cloud object in response to determining that the replication operation has completed. In some examples, the request to modify the cloud object may include deleting the cloud object. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for emulating local storage may include (i) exposing a cloud storage as a local block storage device by providing a translation service that translates commands formatted according to an operating system compatibility standard protocol into commands formatted according to a cloud storage application programming interface protocol, the cloud storage dividing a cloud storage volume into multiple objects, (ii) receiving a command that is formatted according to the operating system compatibility standard protocol and that specifies a length and offset of the cloud storage volume, (iii) translating the command into a translated command formatted according to the cloud storage application programming interface protocol, and (iv) returning a result of executing the translated command. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for distributing information across failure domains in servers may include (1) dividing, at a computing device, each of a quantity of “K” failure domains (FDs) in a plurality of FDs into a quantity of “P” portions, where the “K” FDs in the plurality of FDs are constituent parts of respective servers in a plurality of servers, “P” is less than “K,” and “P” is a sum of a quantity of “M” data portions and a quantity of “N” parity portions, (2) creating a quantity of “K” erasure-coded volumes in the “K” FDs, where each erasure-coded volume includes “M” data portions and “N” parity portions, and each portion in each erasure-coded volume is stored in a different FD and (3) combining the “K” volumes to create a file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for automatic storage tiering may include (1) receiving characteristics of previous accesses to storage system objects stored in a data storage system including multiple storage tiers, (2) generating, based on the characteristics of previous accesses to the storage system objects, a model that predicts characteristics of future accesses to the storage system objects, (3) selecting, based on the model, a next storage tier of the multiple storage tiers for each of the storage system objects, and (4) relocating at least some of the storage system objects from a current storage tier to the next storage tier selected for each of the at least some of the storage system objects. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for storing information within hybrid storage with local and cloud-based storage devices may include (1) dividing, if required, at the computing device, a file into multiple portions, (2) storing a first portion of the multiple portions as at least one first respective separate object on a local volume stored on the local storage device, (3) storing a second portion of the multiple portions as at least one second respective separate object on a cloud-based volume stored on a cloud-based storage device, and (4) naming each stored portion of the file with a respective object name comprising file metadata describing respective characteristics of the respective portion of the file. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for detecting bit rot in distributed storage devices having failure domains may include (1) receiving, at a computing device, a combination of data chunks created by adding, for each failure domain storing data chunks, data chunks from different stripes, (2) receiving a combination of parity chunks created by adding, for each failure domain storing parity chunks, parity chunks from the different stripes, (3) creating at least one new parity chunk from the combination of data chunks, and (4) identifying a presence of bit rot in the failure domains when the at least one new parity chunk does not match the combination of parity chunks. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for write-once-read-many storage may include (1) receiving, at a file system on the computing device, a request to assign a write-once-read-many (WORM) attribute to a file, wherein the request is received from an application, (2) setting, in response to the request to assign the WORM attribute to the file, a WORM flag in an extended attribute associated with the file, and (3) associating with the file, in response to the setting of the WORM flag, a retention period attribute and read-only access until the end of the retention period. The provided systems and methods may provide per-file WORM support at a file system level using extended attributes of the file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Provided computer-implemented methods for prioritizing cache objects for deletion may include (1) tracking, at a computing device, a respective time an externally-accessed object spends in an external cache, (2) queuing, when the externally-accessed object is purged from the external cache, the externally-accessed object in a first queue, (3) queuing, when an internally-accessed object is released, the internally-accessed object in a second queue, (4) prioritizing objects within the first queue, based on a cache-defined internal age factor and on respective times the objects spend in the external cache and respective times the objects spend in an internal cache, (5) prioritizing objects within the second queue based on respective times the objects spend in the internal cache, (6) selecting an oldest object having a longest time in any of the first queue and the second queue, and (7) deleting the oldest object. Various other methods, systems, and computer-readable media are disclosed.

Abstract: The disclosed computer-implemented method for storage block replication in a hybrid storage environment may include receiving a request associated with a data source being replicated to modify a cloud object, storing an instruction for modifying the cloud object, determining that a replication operation for the source has completed, and modifying the cloud object and deleting the instruction for modifying the cloud object in response to determining that the replication operation has completed. In some examples, the request to modify the cloud object may include deleting the cloud object. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for write-once-read-many storage may include (1) receiving, at a file system on the computing device, a request to assign a write-once-read-many (WORM) attribute to a file, wherein the request is received from an application, (2) setting, in response to the request to assign the WORM attribute to the file, a WORM flag in an extended attribute associated with the file, and (3) associating with the file, in response to the setting of the WORM flag, a retention period attribute and read-only access until the end of the retention period. The provided systems and methods may provide per-file WORM support at a file system level using extended attributes of the file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed herein are methods, systems, and processes to provide coherency across disjoint caches in clustered environments. It is determined whether a data object is owned by an owner node, where the owner node is one of multiple nodes of a cluster. If the owner node for the data object is identified by the determining, a request is sent to the owner node for the data object. However, if the owner node for the data object is not identified by the determining, selects a node in the cluster is selected as the owner node, and the request for the data object is sent to the owner node.

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, a copy of the object in a local cache of the owner node, (3) releasing, in response to the indication, the grant of the shared lock, (4) receiving, after the releasing of the grant, a request from the requesting node to update the object in the cache, (5) transmitting, in response to the request to update the object, a request for a shared lock for the object, (6) receiving an indication of a grant of the shared lock, and (7) updating, in response to the grant of the shared lock, the object in the cache. Various other methods, systems, and computer-readable media are also disclosed.