Abstract: A vertical jump system is described herein. The system includes a first member and a second member each having a member base that sits under a flooring, a flexible cord that extends between the first member and the second member at a desired height, fixtures coupled to the flexible cord along the first member and the second member. The flexible cord remains at the desired height when contacted. The fixtures are slidable along the first member and the second member and adjust the height of the flexible cord. This configuration allows a user to easily adjust the height of the vertical jump for training, athletics, and competition, without the cord or system components dislodging and causing injury to the user.

Abstract: Facilitating exclusive local locks on a distributed file system is provided herein. An embodiment relates to a node device of a cluster of node devices. The node device can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise determining at least one resource is to be removed from a cache of the node device. The operations also can comprise implementing an exclusive local lock over a defined lock. The defined lock can indicate interest in the at least one resource by other node devices of the cluster of node devices other than the node device. Further, the operations can comprise removing the at least one resource from the cache. The other node devices are not notified of the removing.

Abstract: Facilitating antivirus scan filing locking based on cluster lock mechanism in distributed file systems is provided herein. A system comprises a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations comprise determining an antivirus scan status of an object, based on an open object request received from a node device of a cluster of node devices, which is determined through the use of Lock Value Blocks. The antivirus scanning of the object is a precondition for opening the object. The antivirus scan status of the object is one of an unscanned status, a queued status, or a scanned status. Further, the operations can comprise, based on the antivirus scan status being the queued status or the scanned status, selectively facilitating the opening of the object at the node device while circumventing the precondition.

Abstract: A system can determine a group of changed lines in a file comprising computer-executable instructions. The system can, for the respective changed lines, produce a mapping that identifies respective tests that test the respective changed lines. The system can, from the mapping and for the respective tests, determine a merge that identifies respective ones of the respective changed lines that are tested by the respective tests. The system can, from the merge and for the respective tests of the group of tests, determine respective coverage ratios that represent respective ratios between the respective ones of the respective changed lines of the group of changed lines that are tested by the respective tests and respective total changed lines in the file. The system can select an updated group of tests from the group of tests based on the respective ratios.

Abstract: Sharing a state between network computing devices is described. For instance, a first state update can be received from a second computing device via a network connection. Further, in a shared state file stored in a storage device coupled to the first computing device, a first portion of the shared state file is identified that is allocated to the second computing device. Further, based on the first state update, the first portion of the shared state file can be updated.

Abstract: Delayed node upgrade in distributed systems is described herein. A method as described herein can include halting first client disconnections associated with a reboot operation of a file system update at a first computing node of a computing cluster in response to the first computing node being added to a delay list; causing, in further response to the first computing node being added to the delay list, second client disconnections associated with the reboot operation of the file system update at a second computing node of a group of second computing nodes of the computing cluster that are distinct from the first computing node; clearing, in response to the file system update being completed at respective ones of the group of second computing nodes, the delay list; and restarting, in response to clearing the delay list, the first client disconnections at the first computing node.

Abstract: Techniques are provided for installing patches using a jail. In an example, a computing node boots from a first partition and then mounts a second partition. The computing node can install an upgrade image for an operating system on the second partition. The computing node can then create a jail that sets the mount point of the second partition as the apparent root directory, and install one or more patches within the jail. The computing node can then reboot from the patched and upgraded operating system of the second partition. In this manner, the node can be upgraded with an operating system and one or more patches, while being rebooted once.

Abstract: Facilitating the implementation of cluster counters on lock value blocks in distributed file systems is provided herein. A system comprises a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations comprise receiving, from a first node device of a group of node devices, first information indicative of a first lock value block status of an object, and, from a second node device of the group of node devices, second information indicative of a second lock value block status of the object. The operations also can comprise merging the first information and the second information, resulting in a status of a lock value block of the object implemented at respective node devices of the group of node devices.

Abstract: Facilitating antivirus scan filing locking based on cluster lock mechanism in distributed file systems is provided herein. A system comprises a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations comprise determining an antivirus scan status of an object, based on an open object request received from a node device of a cluster of node devices, which is determined through the use of Lock Value Blocks. The antivirus scanning of the object is a precondition for opening the object. The antivirus scan status of the object is one of an unscanned status, a queued status, or a scanned status. Further, the operations can comprise, based on the antivirus scan status being the queued status or the scanned status, selectively facilitating the opening of the object at the node device while circumventing the precondition.

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: A vertical jump system is described herein. The system includes a first member and a second member each having a member base that sits under a flooring, a flexible cord that extends between the first member and the second member at a desired height, fixtures coupled to the flexible cord along the first member and the second member. The flexible cord remains at the desired height when contacted. The fixtures are slidable along the first member and the second member and adjust the height of the flexible cord. This configuration allows a user to easily adjust the height of the vertical jump for training, athletics, and competition, without the cord or system components dislodging and causing injury to the user.

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: Facilitating exclusive local locks on a distributed file system is provided herein. An embodiment relates to a node device of a cluster of node devices. The node device can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise determining at least one resource is to be removed from a cache of the node device. The operations also can comprise implementing an exclusive local lock over a defined lock. The defined lock can indicate interest in the at least one resource by other node devices of the cluster of node devices other than the node device. Further, the operations can comprise removing the at least one resource from the cache. The other node devices are not notified of the removing.

Abstract: Facilitating object deletion based on delete lock contention in distributed file systems is provided herein. A first node device of a cluster of node devices. The first node device can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise determining whether a contention callback is assigned to an object scheduled to be removed from cache of the first node device. The operations also can comprise, based on the contention callback being assigned to the object, granting a write lock to a second node device of the cluster of node devices and removing from the cache a link to the object.

Abstract: Facilitating object deletion based on delete lock contention in distributed file systems is provided herein. A first node device of a cluster of node devices. The first node device can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise determining whether a contention callback is assigned to an object scheduled to be removed from cache of the first node device. The operations also can comprise, based on the contention callback being assigned to the object, granting a write lock to a second node device of the cluster of node devices and removing from the cache a link to the object.

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: Techniques are provided for installing patches using a jail. In an example, a computing node boots from a first partition and then mounts a second partition. The computing node can install an upgrade image for an operating system on the second partition. The computing node can then create a jail that sets the mount point of the second partition as the apparent root directory, and install one or more patches within the jail. The computing node can then reboot from the patched and upgraded operating system of the second partition. In this manner, the node can be upgraded with an operating system and one or more patches, while being rebooted once.

Abstract: Sharing a state between network computing devices is described. For instance, a first state update can be received from a second computing device via a network connection. Further, in a shared state file stored in a storage device coupled to the first computing device, a first portion of the shared state file is identified that is allocated to the second computing device. Further, based on the first state update, the first portion of the shared state file can be updated.

Abstract: Harmonization of failure domains in a distributed system is provided herein. A data storage system as described herein can include a memory that stores computer executable components and a processor that executes computer executable components stored in the memory. The computer executable components can include a node assignment component that assigns computing nodes in the data storage system to respective failure domains of a set of data failure domains, a hashing component that generates hashing information associated with respective computing nodes of the computing nodes assigned to a selected failure domain of the set of failure domains, and a group update component that designates at least one computing node of the computing nodes in the selected data failure domain to perform an operation associated with the hashing information.