Abstract: A shield system for an ordnance includes a frame and a flexible net subsystem supported by the frame. Diagonal lines of net material intersect at nodes forming diamond shaped mesh openings and a hard point is attached to at least select nodes.

Abstract: A protection system includes a net made of flexible, low breaking strength intersecting lines connected at nodes. A frame supports the net and spaces the net from a vehicle and/or structure. Hard points are disposed at least at select net nodes and feature a multi-sided body with a cavity therein behind a front face thereof. The body includes a lip extending into the cavity. A protrusion extends outwardly from the front face. A tapered plug is received in the cavity and includes a ledge engaged by the lip locking the plug and a net node in the cavity and securing the hard point to the net node in a pivotable fashion.

Abstract: A method of designing an RPG. A computerized model is created of a shield mesh opening with lines of a net intersecting at nodes and with hard points positioned at least at select nodes. The effectiveness of the mesh opening at a plurality of obliquity angles is determined. In the model, a change is made to the size of the mesh opening and the effectiveness is determined again at a plurality of different obliquity angles. Iterations of this process allow an optimal mesh opening size to be determined for a threat such as an RPG.

Abstract: A shield system for an ordnance includes a frame and a flexible net subsystem supported by the frame. Diagonal lines of net material intersect at nodes forming diamond shaped mesh openings and a hard point is attached to at least select nodes.

Abstract: A protection system includes a net made of flexible, low breaking strength intersecting lines connected at nodes. A frame supports the net and spaces the net from a vehicle and/or structure. Hard points are disposed at least at select net nodes and feature a multi-sided body with a cavity therein behind a front face thereof. The body includes a lip extending into the cavity. A protrusion extends outwardly from the front face. A tapered plug is received in the cavity and includes a ledge engaged by the lip locking the plug and a net node in the cavity and securing the hard point to the net node in a pivotable fashion.

Abstract: A method of designing an RPG. A computerized model is created of a shield mesh opening with lines of a net intersecting at nodes and with hard points positioned at least at select nodes. The effectiveness of the mesh opening at a plurality of obliquity angles is determined. In the model, a change is made to the size of the mesh opening and the effectiveness is determined again at a plurality of different obliquity angles. Iterations of this process allow an optimal mesh opening size to be determined for a threat such as an RPG.

Abstract: The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

Abstract: The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

Abstract: In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes selecting a first one of the nodes to serve as a session manager node, and selecting a second one of the nodes to serve as a session node for a data management application. A session of the data management application is created on the session node by sending a message from the session node to the session manager node, causing the session manager node to distribute information regarding the session among the nodes in the cluster. Responsive to the information distributed by the session manager node, events are received at the session node from the nodes in the cluster for processing by the data management application.

Abstract: In a cluster of computing nodes having shared access to one or more file systems in data storage using parallel file system software, a method for managing the data storage includes initiating a session of a data management application on a first one of the nodes, while running a user application on a second one of the nodes. A request is submitted to the parallel file system software by the user application on the second node to mount one of the file systems in the data storage. A mount event message is sent from the second node to the first node responsive to the request, for processing by the data management application on the first node. When the file system is to be unmounted, preunmount and unmount events are sent for processing by the data management application on the first node.

Abstract: An active cluster is dynamically formed to perform a specific task. The active cluster includes one or more data owning nodes of at least one data owning cluster and one or more data using nodes of at least one data using cluster that are to access data of the data owning cluster. The active cluster is dynamic in that the nodes of the cluster are not statically defined. Instead, the active cluster is formed, when a need for such a cluster arises to satisfy a particular task.

Abstract: In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes initiating a session of a data management application on a first one of the nodes, while running a user application on a second one of the nodes. A request is submitted to the parallel file system by the user application on the second node to perform a file operation on a file in one of the volumes of data storage. A data management event message is sent from the second node to the first node responsive to the request, for processing by the data management application on the first node.

Abstract: The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

Abstract: A system and method of managing data movement are provided in which a processing environment is established in a cluster of nodes. The nodes have common access to data residing in one or more data storage units. A data management application (DM) is initiated in the environment. One of the nodes of the cluster is assigned as a coordinating node for managing data movement. Thereafter, a worker thread is posted to one or more of the nodes in the cluster to perform one or more data movement tasks in response to the event. Preferably, a process session is established in the cluster. A session identifier and a data management access right are provided to one or more nodes to permit only the node or nodes having them to execute the worker thread posted to it.

Abstract: In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes initiating a session of a data management application on a first one of the nodes, while running a user application on a second one of the nodes. A request is submitted to the parallel file system by the user application on the second node to perform a file operation on a file in one of the volumes of data storage. A data management event message is sent from the second node to the first node responsive to the request, for processing by the data management application on the first node.

Abstract: In a cluster of computing nodes having shared access to one or more file systems in data storage using parallel file system software, a method for managing the data storage includes initiating a session of a data management application on a first one of the nodes, while running a user application on a second one of the nodes. A request is submitted to the parallel file system software by the user application on the second node to mount one of the file systems in the data storage. A mount event message is sent from the second node to the first node responsive to the request, for processing by the data management application on the first node. When the file system is to be unmounted, preunmount and unmount events are sent for processing by the data management application on the first node.

Abstract: In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes selecting a first one of the nodes to serve as a session manager node, and selecting a second one of the nodes to serve as a session node for a data management application. A session of the data management application is created on the session node by sending a message from the session node to the session manager node, causing the session manager node to distribute information regarding the session among the nodes in the cluster. Responsive to the information distributed by the session manager node, events are received at the session node from the nodes in the cluster for processing by the data management application.

Abstract: A computer system having a shared disk file system running on multiple computers each having their own instance of an operating system and being coupled for parallel data disks. One of the computers serves as a metadata node and manages metadata for parallel read and write actions for a particular file. Metadata is transferred from and to this file from the other computers via this medadata node computer.