Abstract: A system can maintain a record of first files that have been accessed via at least one of a group of priority user accounts, wherein the record is maintained as a least recently used structure, and wherein the first files belong to a group of files. The system can, in response to determining that the group of files is to be backed up, traverse the record of files from a head of the least recently used structure, and, for respective first files of the record of first files, create respective backup tasks for the respective first files. The system can, after backing up the respective first files, perform a backup of second files of the group of files that are omitted from the record of first files.

Abstract: A system can maintain, in a directory, respective first softlinks of respective first files that have a size within a specified range, and that have been modified subsequent to a respective most-recent virus scan. The system can, in response to determining to perform an antivirus scan on a group of files that comprises the first files, perform a first antivirus scan on the first files based on identifying the first softlinks in the directory, and, after performing the first antivirus scan on the first files, perform a second antivirus scan on second files of the group of files that are not identified with respective second softlinks in the directory.

Abstract: A system can determine that a node a storage cluster has failed, wherein respective data protection levels are maintained for respective files. The system can traverse the respective files, comprising, in response to determining that a data protection level for a file is degraded and that the file is a priority file, adding an identifier of the file to a priority table for restoration of data protection, or, in response to determining that the data protection level for the file of the respective files is degraded and that the file is not the priority file, adding the identifier of the file to a non-priority table for the restoration of data protection. The system can, after traversing the files, restore respective first data protection levels of respective first files represented by the priority table, and then restore respective second data protection levels of respective second files represented by the non-priority table.

Abstract: A system can maintain respective extended attributes for respective files in a file system, wherein the respective extended attributes comprise respective first-in-first-out (FIFO) queues of user identities that have been determined to have modified the respective files. The system can receive an indication to perform a delete operation on a first portion of the file system, wherein the indication is indicative of a first user identity for which files are to be preserved. The system can, in response to receiving the indication, evaluate the respective files, comprising in response to determining that the first user identity is omitted from a FIFO queue of the respective FIFO queues, delete a file of the respective files that corresponds to the FIFO queue; and in response to determining that the first user identity is identified in the FIFO queue, refrain from deleting the file.

Abstract: A system can maintain respective extended attributes for respective files in a file system, wherein the respective extended attributes comprise respective first-in-first-out (FIFO) queues of user identities that have been determined to have modified the respective files. The system can receive an indication to perform a delete operation on a first portion of the file system, wherein the indication is indicative of a first user identity for which files are to be preserved. The system can, in response to receiving the indication, evaluate the respective files, comprising in response to determining that the first user identity is omitted from a FIFO queue of the respective FIFO queues, delete a file of the respective files that corresponds to the FIFO queue; and in response to determining that the first user identity is identified in the FIFO queue, refrain from deleting the file.

Abstract: A system can create a group of at least one file on a source computer. The system can perform iterations of backing up the group of at least one file to a destination computer. The system can store respective job status indications of respective iterations of the iterations of backing up the group of at least one file. The system can, in response to determining to back up the data, and in response to determining that the job status indications indicate that at least one iteration of the iterations of backing up the group of at least one file was successful, back up the data to the destination computer, or, in response to determining that the job status indications indicate that the at least one iteration of the iterations of backing up the group of at least one file was unsuccessful, refrain from backing up the data.

Abstract: A system can determine that an integrity of a data backup is to undergo a validation process, wherein the data backup is located at a target location, and wherein the data backup comprises a backup of source data at a source location. The system can identify a subset of files of the source data to validate in the data backup, wherein the subset of files is determined prior to performing the determining that the integrity of the data backup is to undergo the validation process. The system can, as part of validation of the subset of files according to the validation process, validate respective first hashes of respective files of the subset of files relative to respective second hashes of respective corresponding second files of the data backup, to produce a validation result. The system can store the validation result.

Abstract: A system can to perform a replication of data from first computing equipment to second computing equipment, the data being stored as part of a path in a file system. The system can, from a replication policy for the replication, a priority sub-path of the path. The system can add a first set of files to a transfer queue comprising tree-walking the priority sub-path. The system can, after adding the first set of files, adding a second set of files to the transfer queue comprising tree-walking a portion of the path that is different from the priority sub-path. The system can replicate files in the transfer queue from the first computing equipment to the second computing equipment.

Abstract: A system can determine to perform a replication of data from first computing equipment to second computing equipment, the data being stored as part of a path in a file system. The system can determine that a change log of file operations on files in the path identifies a file operation on a file that is made by a user account that has priority for replications. The system can replicate the file. The system can, after processing the change log for file operations made by first user accounts that have priority for replications, replicating other files in the path associated with second user accounts that do not have priority for replications.

Abstract: A system can identify a first group of files that are scheduled to be modified by another operation within a next defined amount of time. The system can remove the first group of files from the files of the file system with respect to a deduplication operation to produce a second group of files. The system can perform a sampling phase on the second group of files, wherein the sampling phase identifies a first group of blocks, and wherein the first group of blocks corresponds to duplicate file system blocks. The system can identify a second group of blocks that correspond to the first group of files. The system can remove any blocks from the first group of blocks that have a respective duplicate in the second group of blocks to produce a third group of blocks. The system can perform the deduplication operation on the third group of blocks.

Abstract: Methods, apparatus, and processor-readable storage media for application aware cache management are provided herein. An example computer-implemented method includes maintaining a data structure comprising at least one entry indicative of an importance of at least one of a plurality of applications associated with a storage system; and controlling whether or not a particular data item requested by one of the plurality of applications is cached in a cache memory of the storage system based at least in part on the at least one entry of the data structure.

Abstract: Techniques are provided for data size and time based replication. In an example, a first daemon monitors data changes that corresponds to a first replication policy, and a second daemon monitors an amount of time since performing a replication for the first replication policy. Where either a data modification threshold is met, or a time threshold is met, the daemons can perform a replication, and reset both a data counter and a timer that determine when next to perform a replication.

Abstract: Techniques are provided for tracking users modifying, writing, or editing a file. In an example, a file system maintains a first-in-first-out queue that logs a finite set of users that have most-recently modified a file. This queue can be maintained in an extended attribute of an Mode that corresponds to a file. Where a user modifies a file, and the user is currently identified in the queue, the user can be removed from the queue. Where the user modifies a file, is not currently identified in the queue, and the queue is full, an oldest user in the queue can be removed from the queue. Then, the user can be added to the back of the queue.

Abstract: A system can determine to perform a replication of data from first computing equipment to second computing equipment, wherein the data is stored within a path in a file system of the first computing equipment. The system can determine the path from a replication policy for the replication. The system can, while tree-walking the path, in response to determining that a first file is marked for priority replication, adding the first file to a priority queue, and in response to determining that a second file lacks a marking for priority replication, adding the second file to a normal queue. The system can, in response to determine that the priority queue contains files, replicating the files from the priority queue instead of replicating other files from the normal queue.

Abstract: A system can determine to perform a replication of data from first computing equipment to second computing equipment, the data being stored as part of a path in a file system. The system can determine that a change log of file operations on files in the path identifies a file operation on a file that is made by a user account that has priority for replications. The system can replicate the file. The system can, after processing the change log for file operations made by first user accounts that have priority for replications, replicating other files in the path associated with second user accounts that do not have priority for replications.

Abstract: A system can to perform a replication of data from first computing equipment to second computing equipment, the data being stored as part of a path in a file system. The system can, from a replication policy for the replication, a priority sub-path of the path. The system can add a first set of files to a transfer queue comprising tree-walking the priority sub-path. The system can, after adding the first set of files, adding a second set of files to the transfer queue comprising tree-walking a portion of the path that is different from the priority sub-path. The system can replicate files in the transfer queue from the first computing equipment to the second computing equipment.

Abstract: A system can determine to perform a replication of data from first computing equipment to second computing equipment, wherein the data is stored within a path in a file system of the first computing equipment. The system can determine the path from a replication policy for the replication. The system can, while tree-walking the path, in response to determining that a first file is marked for priority replication, adding the first file to a priority queue, and in response to determining that a second file lacks a marking for priority replication, adding the second file to a normal queue. The system can, in response to determine that the priority queue contains files, replicating the files from the priority queue instead of replicating other files from the normal queue.

Abstract: Techniques are provided for tracking a virus footprint in data copies. Data copies can be made in a variety of ways, like with snapshots, backups, replications, and simple copies. As copies of files that have not been scanned since they were last modified are made, these copies can be kept track of, and associated with the original file. When the original file is later scanned and found to be clean or infected, this information can be propagated through the copies.

Abstract: Techniques are provided for user-based data tiering. In an example, a computer maintains a first-in-first-out queue that logs a finite set of users that have most-recently modified a file. This queue can be maintained in an extended attribute of an inode that corresponds to a file. A computer can also maintain a policy that defines how to perform storage tiering on a file based on which users have accessed the file. When a tiering operation is performed, the files specified by a corresponding tiering policy can be evaluated for which users have recently accessed them. When a user specified by the tiering policy has recently modified a file, the file can be placed in tiering queue for tiering.

Abstract: Techniques are provided for data size based replication. In an example, a replication daemon registers to receive notifications about data changes from a protocol driver. The replication daemon can maintain a counter for each of one or more replication policies, where a counter tracks how much data has changed that corresponds to a replication policy, since the prior replication for that replication policy. Where the daemon receives a notification for the protocol driver, it can determine whether the notification applies to any replication policy, and update any counters accordingly. Where an amount of data changed since the prior replication exceeds a threshold for a replication policy, a replication can be started. Upon successful completion of the replication, the corresponding counter can be reset.