Patent application number | Description | Published |
20090037598 | Providing Nearest Neighbor Point-to-Point Communications Among Compute Nodes of an Operational Group in a Global Combining Network of a Parallel Computer - Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier. | 02-05-2009 |
20090040946 | Executing an Allgather Operation on a Parallel Computer - Methods, apparatus, and products are disclosed for executing an allgather operation on a parallel computer that includes a plurality of compute nodes organized into at least one operational group of compute nodes for collective parallel operations, each compute node in the operational group assigned a unique rank, that includes: determining a contention-free logical ring topology for the compute nodes in the operational group; configuring, for each compute node in the operational group according to the contention-free logical ring topology, a routing table to specify a forwarding path to the next compute node in the logical ring topology; and repeatedly, for each compute node in the operational group until each compute node has received contributions for all of the other compute nodes in the operational group, forwarding a contribution for the allgather operation to the next compute node in the logical ring topology along the forwarding path. | 02-12-2009 |
20090043540 | Performance Testing of Message Passing Operations in a Parallel Computer - Methods, apparatus, and products are disclosed for performance testing of message passing operations in a parallel computer, the parallel computer comprising a plurality of compute nodes organized into at least one operational group, that include: establishing, on a compute node of the operational group, a number of measurement iterations for testing a message passing operation, a first group of the measurement iterations designated as warm-up iterations, and a second group of the measurement iterations designated as testing iterations; for each measurement iteration: executing, by the compute node, the message passing operation under test, and measuring, by the compute node, an elapsed time for only the execution of the message passing operation under test; and determining, by the compute node, a performance result in dependence upon the elapsed time for each measurement iteration designated as one of the testing iterations. | 02-12-2009 |
20090043912 | Providing Full Point-To-Point Communications Among Compute Nodes of an Operational Group in a Global Combining Network of a Parallel Computer - Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link. | 02-12-2009 |
20090046585 | Determining Communications Latency for Transmissions Between Nodes in a Data Communications Network - Methods, systems, and apparatus are disclosed for determining communications latency for transmissions between nodes in a data communications network that include: preparing, by an origin node, to receive an acknowledgement message from a target node, the acknowledgement message indicating that the target node is ready to receive a test message from the origin node; receiving, by the origin node from the target node, the acknowledgement message; sending, by the origin node to the target node in response to receiving the acknowledgement message, the test message; preparing, by the origin node, to receive an echo message from the target node; receiving, by the origin node from the target node, the echo message; and determining, by the origin node, a round-trip communications latency between the origin node and the target node in dependence upon the sending of the test message and the receiving of the echo message. | 02-19-2009 |
20090049114 | Determining a Bisection Bandwidth for a Multi-Node Data Communications Network - Methods, systems, and products are disclosed for determining a bisection bandwidth for a multi-node data communications network that include: partitioning nodes in the network into a first sub-network and a second sub-network in dependence upon a topology of the network; sending, by each node in the first sub-network to a destination node in the second sub-network, a first message having a predetermined message size; receiving, by each node in the first sub-network from a source node in the second sub-network, a second message; measuring, by each node in the first sub-network, the elapsed communications time between the sending of the first message and the receiving of the second message; selecting the longest elapsed communications time; and calculating the bisection bandwidth for the network in dependence upon the number of the nodes in the first sub-network, the predetermined message size of the first test message, and the longest elapsed communications time. | 02-19-2009 |
20090240838 | Broadcasting A Message In A Parallel Computer - Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path. | 09-24-2009 |
20090245134 | Broadcasting A Message In A Parallel Computer - Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node. | 10-01-2009 |
20120189012 | Providing Point To Point Communications Among Compute Nodes In A Global Combining Network Of A Parallel Computer - Methods, apparatus, and products are disclosed for providing point to point data communications among compute nodes in a global combining network of a parallel computer that include: determining a class route identifier available for all of the nodes along a communications path from an origin node to a target node; configuring network hardware of each node along the communications path with routing instructions in dependence upon the available class route identifier and the network's topology; transmitting, by the origin node along the communications path, a network packet to the target node, including encoding the available class route identifier in the network packet; and routing, by the network hardware of each node along the communications path, the network packet to the target node in dependence upon the routing instructions for each node and the available class route identifier. | 07-26-2012 |