Abstract: Techniques can be implemented to provide for antivirus scanning in clustered storage where not all nodes of the cluster are connected to an antivirus server. A first computing node of computing nodes of a computing cluster can determine a status of an antivirus server. The first computing node can send a first indication of the status of the antivirus server to a group management protocol service of the computing cluster. The group management protocol service can send a second indication of whether the first computing node is available for antivirus scanning to a job engine of the computing cluster. The job engine can distribute an antivirus job among the computing nodes based on whether the first computing node is available for the antivirus scanning.

Abstract: Shielding a storage device of a storage system from one or more storage performance enhancement procedures (SPEPs) is disclosed. A SPEP can be regarded as a procedure that manipulates data stored via a storage device in a manner that attempts to improve performance of the storage system. As such, SPEPs are generally distinct from basic reading and writing of data that is not associated with storage system performance optimization. A SPEP can typically be effectively run without storage device performance degradation, however some conditions, such as very full drives, etc., can result in substantial storage device performance degradation where one or more SPEP is performed. As such, shielding can restrict permission to perform one or more SPEPs at a storage device expected to, or actually experiencing, a threshold level of performance degradation. Shielding is distinct from conventional techniques marking a drive as failed, failing, etc., as is disclosed herein.

Abstract: Shielding a storage device of a storage system from one or more storage performance enhancement procedures (SPEPs) is disclosed. A SPEP can be regarded as a procedure that manipulates data stored via a storage device in a manner that attempts to improve performance of the storage system. As such, SPEPs are generally distinct from basic reading and writing of data that is not associated with storage system performance optimization. A SPEP can typically be effectively run without storage device performance degradation, however some conditions, such as very full drives, etc., can result in substantial storage device performance degradation where one or more SPEP is performed. As such, shielding can restrict permission to perform one or more SPEPs at a storage device expected to, or actually experiencing, a threshold level of performance degradation. Shielding is distinct from conventional techniques marking a drive as failed, failing, etc., as is disclosed herein.

Abstract: Techniques can be implemented to provide for antivirus scanning in clustered storage where not all nodes of the cluster are connected to an antivirus server. A first computing node of computing nodes of a computing cluster can determine a status of an antivirus server. The first computing node can send a first indication of the status of the antivirus server to a group management protocol service of the computing cluster. The group management protocol service can send a second indication of whether the first computing node is available for antivirus scanning to a job engine of the computing cluster.

Abstract: Described herein are technologies directed to cluster group change preparation techniques. Prior to a cluster group change operation, such as a merge or a split of a node with a group, a notification of a planned group change operation can be sent to the nodes of a group. In response to the notification, the nodes of the group can perform group change preparation operations disclosed herein. The group change operation can be blocked while the group change preparation operations are underway. The group change operation can proceed after the nodes of the group indicate completion of the group change preparation operations.

Abstract: Described herein are technologies directed to lazy lock queue reduction in computing clusters. The disclosed lazy lock queue reduction techniques can be performed in preparation for cluster group changes. Prior to a cluster group change operation, such as a merge or a split of a node with a group, a notification of a planned group change operation can be sent to the nodes of a group. In response to the notification, the nodes of the group can perform lazy lock queue reduction techniques disclosed herein. In one disclosed lazy lock queue reduction technique, a node can set a drain goal for a lazy lock queue, and the node can drain the lazy lock queue according to the drain goal. In another disclosed lazy lock queue reduction technique, a node can set an age limit for lazy lock queue entries, and the node can remove lazy lock queue entries which are expired or over the age limit.

Abstract: Described herein are technologies directed to cluster group change preparation techniques. Prior to a cluster group change operation, such as a merge or a split of a node with a group, a notification of a planned group change operation can be sent to the nodes of a group. In response to the notification, the nodes of the group can perform group change preparation operations disclosed herein. The group change operation can be blocked while the group change preparation operations are underway. The group change operation can proceed after the nodes of the group indicate completion of the group change preparation operations.

Abstract: Described herein are technologies directed to lazy lock queue reduction in computing clusters. The disclosed lazy lock queue reduction techniques can be performed in preparation for cluster group changes. Prior to a cluster group change operation, such as a merge or a split of a node with a group, a notification of a planned group change operation can be sent to the nodes of a group. In response to the notification, the nodes of the group can perform lazy lock queue reduction techniques disclosed herein. In one disclosed lazy lock queue reduction technique, a node can set a drain goal for a lazy lock queue, and the node can drain the lazy lock queue according to the drain goal. In another disclosed lazy lock queue reduction technique, a node can set an age limit for lazy lock que entries, and the node can remove lazy lock queue entries which are expired or over the age limit.

Abstract: Extended group service changes are facilitated in a data storage system. Node devices of a data storage system are identified that are merging into a cluster of the node devices. In response to the identifying, respective merge locks are caused at a group of the node devices that are sending service updates.

Abstract: Node resets in a distributed environment can be disruptive due to the need to reset shared state. However, a central system can notify all other nodes asynchronously of a pending event, and then multiple nodes can use that notification to mitigate costs when it actually happens. For example, in anticipation of a first node leaving a group of nodes, a second node can reduce its cache to store the cache from the first node. Additionally, a client device can be directed to the second node so as not to interrupt a service provided to the client device by the first node.

Abstract: Extended group service changes are facilitated in a data storage system. Node devices of a data storage system are identified that are merging into a cluster of the node devices. In response to the identifying, respective merge locks are caused at a group of the node devices that are sending service updates.

Abstract: Node resets in a distributed environment can be disruptive due to the need to reset shared state. However, a central system can notify all other nodes asynchronously of a pending event, and then multiple nodes can use that notification to mitigate costs when it actually happens. For example, in anticipation of a first node leaving a group of nodes, a second node can reduce its cache to store the cache from the first node. Additionally, a client device can be directed to the second node so as not to interrupt a service provided to the client device by the first node.

Abstract: Implementations are provided herein for using a distributed DNS cache that is distributed among nodes of a cluster of nodes operating as a distributed file system. A consistent hash can be used to determine a resolution node for a DNS request asking to resolve a specific FQDN. The inputs to the consistent hashing algorithm can be the FQDN, a set of available nodes, and a set of all possible nodes. By using a consistent hash, the process can reduce the sensitivity of the hashing algorithm output from changing when nodes added or removed as participants in the distributed cache service. As each node in the cluster of nodes can independently calculate a resolution node for specific FQDN, there is no need to send control messages between nodes, as each node only needs to be aware of the set of available nodes in the cluster of nodes.

Abstract: Implementations are provided herein for using a distributed DNS cache that is distributed among nodes of a cluster of nodes operating as a distributed file system. A consistent hash can be used to determine a resolution node for a DNS request asking to resolve a specific FQDN. The inputs to the consistent hashing algorithm can be the FQDN, a set of available nodes, and a set of all possible nodes. By using a consistent hash, the process can reduce the sensitivity of the hashing algorithm output from changing when nodes added or removed as participants in the distributed cache service. As each node in the cluster of nodes can independently calculate a resolution node for specific FQDN, there is no need to send control messages between nodes, as each node only needs to be aware of the set of available nodes in the cluster of nodes.

Abstract: A method is disclosed for automatically provisioning network devices for use with virtual circuit networks, such as frame relay and ATM networks. The device receives a list of identifiers corresponding to virtual circuits from a configuration interface for the virtual circuit network. The device iteratively applies each identifier from the list to individual instances of interface configuration commands and attempts to provide connectivity with a remote device. Once a configuration command is applied, the device will obtain an IP address for a device terminating the virtual circuit corresponding to the identifier selected from the list; and determines an IP address for itself. The device tests the virtual circuit for connectivity with the remote device. If the device is able to determine that the virtual circuit corresponding to the selected identifier provides connectivity to the remote device, then that virtual circuit is used to connect to the remote device.