Emc IP Holding Company LLC

Veritas Technologies LLC

Dell Products Inc.

Emc Corporation

Jai P Gahlot

Shiv S Kumar

Amit Chauhan

Abhijit Toley

Kaushik Gupta

Avadut Mungre

Amol Shivram Katkar

Udipta Das

Pranav Peshwe

Shailesh Marathe

Vikas Goel

Narender Singh Mehra

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.

File transfer prioritization during replication

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.

A system can maintain information indicative of prohibited computer operations, wherein the information is accessible to respective computing clusters of a group of computing clusters, and wherein the information is stored separately from the group of computing clusters. The system can obtain, by a service of a first computing cluster of the group of computing clusters, the information. The system can, in response to receiving, at the first computing cluster, a request to perform an operation on a first computer of the first computing cluster, in response to determining, based on the information, that the operation is prohibited, prevent the operation from occurring; and, in response to determining, based on the information, that the operation is not prohibited, permit the operation to occur.

Proactive prevention of data unavailability and data loss

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.

Application aware cache management

A Software Defined Network Attached Storage (SDNAS) executes on a storage system to provide access to shared file systems, referred to as 'shares', on the storage system. Users access the shares using protocol clients. To enable the SDNAS to provide differentiated prioritization between the various shares, a share priority table is maintained by the SDNAS. As shares are created, or optionally after the shares have been created, each share is assigned a share priority which is stored in the share priority table. When an IO operation is received from a protocol client on a share, the SDNAS process determines a share priority value of the share from the share priority table. The share priority value is used to specify an IO priority which used by the operating system scheduling mechanism to schedule the IO operation and to establish a CPU priority for the IO operation.

Method and apparatus for providing differentiated share prioritization in a storage system

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.

Data size and time based replication

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.

Tracking users modifying a file

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.

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.

Tracking a virus footprint in data copies

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.

User-based data tiering

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.

Data size based replication

Files can be managed to mitigate undesirable reading of files from secondary storage component (SSC) associated with a storage system comprising primary storage component (PSC). File management component (FMC) can determine file identifiers for files stored in SSC and store them in reference files associated with such files. FMC can determine file identifiers for files stored in PSC and store them in a file entry data store. In response to a client request, FMC can determine whether a local file stored in PSC is a copy of an archived file stored in SSC based on whether the respective file identifiers of the archived file and local file or snapshot of the local file match. If there is a suitable match, FMC can read the snapshot of the local file and provide it to client device; if not, FMC can read the archived file and provide it to client device.

Enhanced reading or recalling of archived files

A Software Defined Network Attached Storage (SDNAS) executes on a storage system to provide access to shared file systems, referred to as 'shares', on the storage system. Users access the shares using protocol clients. A share priority table is maintained by the SDNAS and used to specify share priorities on the storage system. A share priority adjustment process is used to dynamically adjust the share priority values based on average usage values computed using a weighted usage function, and optionally based on limited ranges. The weighted usage function considers the average number of protocol client connections on the share, the average number of read operations on the share, whether the share supports continuous availability, and other factors. The adjusted share priority values are used to specify IO priorities which used by the operating system scheduling mechanism to schedule the IO operations and to establish CPU priorities for the IO operations.

Method and apparatus for dynamically adjusting differentiated share prioritization in a storage system

Filename-based malware pre-scanning is described herein. A method as described herein can include obtaining, by a device operatively coupled to a processor, a malware scan request for a first file in a directory of a file system, the first file having a first filename belonging to a filename sequence; appending, by the device, the first file to a first malware scan queue; and appending, by the device, respective second files in the directory to a second malware scan queue that is distinct from the first malware scan queue, wherein the respective second files are distinct from the first file and have respective second filenames belonging to the filename sequence.

Filename-based malware pre-scanning

Filename-based malware pre-scanning is described herein. A method as described herein can include establishing sequential malware scanning for respective files in a first directory of a file system according to filenames of the respective files; comparing an elapsed time since a previous malware scan for a first file of the respective files in the first directory having a first filename in a filename sequence to a scan age threshold associated with a scheduled malware scan task for the first directory; and, in response to the elapsed time since the previous malware scan for the first file being determined to be less than the scan age threshold, removing the scheduled malware scan task with respect to the first file and at least one second file of the respective files in the first directory having respective second filenames in the filename sequence.

Growing community of inventors

Pune, India

Jai P Gahlot