Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

Abstract: Systems and methods which provide an absent allocation technique with respect to absent data of a data structure for which data migration in a time-displaced data migration operation has not completed are disclosed. Through use of absent allocated data block states of an absent allocation technique of embodiments, dependency between source and destination data stores may be broken. An absent allocated data block state of embodiments stored within the data structure provides a suggestive indication that data of a data block of a data structure is absent from the data structure. A corresponding absent allocated data block state of embodiments stored external to the data structure provides a determinative indication that the data of the data block of the data structure is absent from the data structure. The absent data block determinative indictor of embodiments is updated as data continues to be migrated.

Abstract: A method, non-transitory computer readable medium, and device that replicates data and provides instantaneous access to data includes receiving in a destination volume one or more named data extents and one or more references to the one or more named data extents associated with a file in parallel from a source volume. A determination is made to check whether the one or more references arrive before the one or more named data extents arrive. Each of the received one or more references which are determined to have arrived prior to the one or more data extents is allocated as absent by the storage management computing device. An instantaneous access to the file is provided during the allocation.

Abstract: Techniques for harmonic-resistant file striping are described. In one embodiment, for example, an apparatus may comprise a processor circuit and a storage medium comprising instructions for execution by the processor circuit to receive a request to write data to a file at a specified offset, determine a stripe identifier (ID) based on the specified offset according to a harmonic-resistant striping order, and initiate a write procedure to cause the data to be written to a stripe of the file, the stripe corresponding to the stripe ID. Other embodiments are described and claimed.

Abstract: Methods and a processing system directed to a file system checker are described. A file system checker performs file system validation by validating a file system's nodes. Each node is associated with two kinds of data: metadata and referenced data. A file system checker may validate one node at a time or a group of nodes contemporaneously (e.g., in parallel). The file system checker uses a dual phase procedure. The first phase includes validating metadata. The second phase includes validating, as appropriate, node type or link count. Dual phase file system checking allows validation of a node without validating referenced data associated with downstream nodes. Where validation of a given node requires validating a downstream node, performing a first phase test on the downstream node is sufficient to validate the given node. Upon completion, the given node may be unlocked for access by external devices and users.

Abstract: The present invention overcomes the disadvantages of the prior art by providing a technique that stripes data containers across volumes of a striped volume set (SVS) using one of a plurality of different data placement patterns to thereby reduce the possibility of hotspots arising due to each data container using the same data placement pattern within the SVS. The technique is illustratively implemented by calculating a first index value, an intermediate index value and calculating a hash value of an inode associated with a data container to be accessed within the SVS. A final index value is calculated by multiplying the intermediate index value by the hash value, modulo the number of volumes of the SVS. Further, a Locate( ) function may be used to compute the location of data container content in the SVS to which a data access request is directed to ensure consistency of such content.

Abstract: Methods and a processing system directed to a file system checker are described. A file system checker performs file system validation by validating a file system's nodes. Each node is associated with two kinds of data: metadata and referenced data. A file system checker may validate one node at a time or a group of nodes contemporaneously (e.g., in parallel). The file system checker uses a dual phase procedure. The first phase includes validating metadata. The second phase includes validating, as appropriate, node type or link count. Dual phase file system checking allows validation of a node without validating referenced data associated with downstream nodes. Where validation of a given node requires validating a downstream node, performing a first phase test on the downstream node is sufficient to validate the given node. Upon completion, the given node may be unlocked for access by external devices and users.

Abstract: The present invention overcomes the disadvantages of the prior art by providing a technique that stripes data containers across volumes of a striped volume set (SVS) using one of a plurality of different data placement patterns to thereby reduce the possibility of hotspots arising due to each data container using the same data placement pattern within the SVS. The technique is illustratively implemented by calculating a first index value, an intermediate index value and calculating a hash value of an inode associated with a data container to be accessed within the SVS. A final index value is calculated by multiplying the intermediate index value by the hash value, modulo the number of volumes of the SVS. Further, a Locate( ) function may be used to compute the location of data container content in the SVS to which a data access request is directed to ensure consistency of such content.

Abstract: Systems and methods which provide an absent allocation technique with respect to absent data of a data structure for which data migration in a time-displaced data migration operation has not completed are disclosed. Through use of absent allocated data block states of an absent allocation technique of embodiments, dependency between source and destination data stores may be broken. An absent allocated data block state of embodiments stored within the data structure provides a suggestive indication that data of a data block of a data structure is absent from the data structure. A corresponding absent allocated data block state of embodiments stored external to the data structure provides a determinative indication that the data of the data block of the data structure is absent from the data structure. The absent data block determinative indictor of embodiments is updated as data continues to be migrated.

Abstract: A method and apparatus for striping a directory across storage server nodes. Each storage server node services one of a plurality of persistent mass storage facilities. The method comprises mapping each filename in the directory to one of the persistent mass storage facilities. According to the mapping of the filenames, the directory is distributed across the storage server nodes for storage on the persistent mass storage facilities.