Abstract: A system to improve communication security in cluster machine processing may include interconnected computers that can jointly process data. The system may also include a shared secret key used by each of the interconnected computers to encrypt, decrypt, and/or authenticate data being sent, or received, from one of the interconnected computers to another of the interconnected computers. The system may further include a new shared secret key used by each of the interconnected computers to encrypt, decrypt, and/or authenticate data being sent, or received, from one of the interconnected computers to another of the interconnected computers. In addition, the new shared secret key may coexist with the shared secret key without adversely affecting the joint processing of data performed by the plurality of interconnected computers.

Abstract: A method is provided for establishing clusters in a distributed data processing environment having a plurality of nodes. The frequency of messages sent for the purpose of cluster formation is selected based on ranking of the nodes. Higher ranking nodes transmit such messages more frequently than lower ranking nodes. Lower ranked nodes thus are provided with an opportunity to join a cluster without first having to transmit their own messages to effectuate the joining.

Abstract: A method for communicating node liveness in a multinode data processing system employs an operating system function that provides a degree of self-awareness in “sensing” an imminent but still pending failure as the basis for providing special flag signals over a channel which employs nonvolatile storage in a heartbeat signaling path.

Abstract: A system to improve communication security in cluster machine processing may include interconnected computers that can jointly process data. The system may also include a shared secret key used by each of the interconnected computers to encrypt, decrypt, and/or authenticate data being sent, or received, from one of the interconnected computers to another of the interconnected computers. The system may further include a new shared secret key used by each of the interconnected computers to encrypt, decrypt, and/or authenticate data being sent, or received, from one of the interconnected computers to another of the interconnected computers. In addition, the new shared secret key may coexist with the shared secret key without adversely affecting the joint processing of data performed by the plurality of interconnected computers.

Abstract: A method is provided for establishing clusters in a distributed data processing environment having a plurality of nodes. The frequency of messages sent for the purpose of cluster formation is selected based on ranking of the nodes. Higher ranking nodes transmit such messages more frequently than lower ranking nodes. Lower ranked nodes thus are provided with an opportunity to join a cluster without first having to transmit their own messages to effectuate the joining.

Abstract: A method is provided for establishing clusters in a distributed data processing environment having a plurality of nodes. The frequency of messages sent for the purpose of cluster formation is selected based on ranking of the nodes. Higher ranking nodes transmit such messages more frequently than lower ranking nodes. Lower ranked nodes thus are provided with an opportunity to join a cluster without first having to transmit their own messages to effectuate the joining.

Abstract: A method for communicating node liveness in a multinode data processing system employs an operating system function that provides a degree of self-awareness in “sensing” an imminent but still pending failure as the basis for providing special flag signals over a channel which employs nonvolatile storage in a heartbeat signaling path.

Abstract: In distributed multinode data processing systems, mechanisms are employed to insure that the nodes are properly informed about the liveness of the other nodes in node groups in the network. In particular, the present invention employs group membership indicia as part of a mechanism for detecting that a node and/or its adapter have failed and have been recently restarted. Having detected this situation, group membership inconsistencies which it can engender are avoided.

Abstract: Liveness determination in a multinode data processing system is enhanced through the use of a shared nonvolatile memory, typically a disk, which is utilized in conjunction with defined transmission protocols to provide an independent communication path usable for both the transmission of node liveness information and for other, more general, data transfer purposes. This path is considered as having the same degree of importance as other network paths and liveness indications from the shared memory path are likewise considered at the same time as liveness indications from another path or paths.

Abstract: Liveness determination in a multinode data processing system is enhanced through the use of a shared nonvolatile memory, typically a disk, which is utilized in conjunction with defined transmission protocols to provide an independent communication path usable for both the transmission of node liveness information and for other, more general, data transfer purposes. This path is considered as having the same degree of importance as other network paths and liveness indications from the shared memory path are likewise considered at the same time as liveness indications from another path or paths.

Abstract: In distributed multinode data processing systems, mechanisms are employed to insure that the nodes are properly informed about the liveness of the other nodes in node groups in the network. In particular, the present invention employs group membership indicia as part of a mechanism for detecting that a node and/or its adapter have failed and have been recently restarted. Having detected this situation, group membership inconsistencies which it can engender are avoided.

Abstract: A method of upsetting a headed rivet in a countersunk hole using an electromagnetic riveting machine having two opposed drivers which are impelled against each end of the rivet to upset the rivet with a single stroke of the machine. The movement of the driver at the headed end of the rivet in initiated slightly after movement of the driver at the shank end of the rivet to lift the headed end of the rivet slightly out of the countersink so, when the headed end driver operates, the rivet shank is deformed to fill the rivet hole as the head is driven back into the countersink for good shank interference in the hole adjacent the rivet head.

Abstract: A method of riveting includes drilling a hole in a workpiece with a drill bit held in a spindle mounted on an axial centerline of a drill/rivet machine. The drill descends through a drill/suction cavity of a movable shuttle and drill chips cut by the drill bit are suctioned away from the workpiece as they are made. The drill bit is withdrawn to a level just above the drill/suction cavity, which is then moved to position a rivet insert station over the newly drilled hole in the workpiece. A rivet is blown into the rivet insert station, is guided into alignment with the hole and injected directly into the hole by air pressure. The shuttle moves a rivet die over the newly installed rivet in the hole and a driver of an electromagnetic riveter is lowered into contact with the die, which in turn is pressed against the rivet head. Another rivet die is pressed against the rivet tail on the other side of the panel by a driver of another electromagnetic riveter.

Abstract: This invention relates to a machine and its constituent components for drilling a hole in a workpiece, inserting a rivet in the hole, and upsetting the rivet, all without moving the lateral position of the machine or the workpiece, and to an assembly for supporting and positioning a plurality of said machines for working simultaneously on the workpiece.