# US 2015/0106482 A1 · Identifying A Largest Logical Plane From A Plurality Of Logical Planes Formed Of Compute Nodes Of A Subcommunicator In A Parallel Computer

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0106482 A1
- Document ID: US20150106482A1
- Status: Published application
- Kind: A1
- Application number: 14/053,171
- Filed: 2013-10-14
- Published: 2015-04-16
- Earliest claimed: 2013-10-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: KRISTAN D. DAVIS; DANIEL A. FARAJ
- Web page: https://patentgrep.com/patent/US20150106482A1

## CPC

- G06F 15/17318: {Parallel communications techniques, e.g. gather, scatter, reduce, roadcast, multicast, all to all}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In a parallel computer, a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: identifying, by each compute node of the subcommunicator, all logical planes that include the compute node; calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane; initiating, by a root node of the subcommunicator, a gather operation; receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.

## Claims

### Claim 1

A method of identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer, the method comprising:
identifying, by each compute node of the subcommunicator, all logical planes that include the compute node;
calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane;
initiating, by a root node of the subcommunicator, a gather operation;
receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and
identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.

### Claim 2 (depends on 1)

The method of claim 1 further comprising:
performing data communications amongst the compute nodes of the subcommunicator included in the logical plane have the greatest area including utilizing data communications techniques optimized for regular topologies.

### Claim 3 (depends on 1)

The method of claim 1 wherein identifying, by each compute node, all logical planes that include the compute node further comprises:
for each compute node of the subcommunicator and iteratively, for a plurality of dimensions beginning with a first dimension:
establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, wherein the second dimension is orthogonal to the first dimension; and
establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
establishing in the positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a negative direction of the second dimension; and
establishing in the negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the negative direction of the second dimension.

### Claim 5 (depends on 3)

The method of claim 3, wherein establishing, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, further comprises:
assigning the plane building node to be the lower left node of a logical plane of the sub communicator;
iteratively, beginning with a node one hop away from the lower left node in a positive direction of the first dimension until a node at a next hop away from the lower left node is not included in the subcommunicator:
assigning a node at a next hop away from the lower left node in the positive direction of the first dimension to be the lower right node of the logical plane of the subcommunicator; and
iteratively, beginning with nodes one hop away from the lower left node and lower right node in a positive direction of a second dimension until a node at a next hop away from the lower left or lower right node is not included in the subcommunicator: assigning a node at a next hop away from the lower left node in the positive direction of the second dimension to be the upper left node of the logical plane and assigning a node at a next hop away from the lower right node in the positive direction of the second dimension to be the upper right node of the logical plane.

### Claim 6 (depends on 3)

The method of claim 3, wherein establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension, further comprises:
assigning the plane building node to be the lower right node of a logical plane of the sub communicator;
iteratively, beginning with a node one hop away from the lower right node in the negative direction of the first dimension until a node at a next hop away from the lower right node is not included in the subcommunicator:
assigning a node at a next hop away from the lower right node in the negative direction of the first dimension to be the lower left node of the logical plane of the subcommunicator; and
iteratively, beginning with a node one hop away from the lower right node and a node one hop away from the lower left node in the positive direction of the second dimension until a node at a next hop away from the lower right or lower left node is not included in the subcommunicator: assigning a node at a next hop away from the lower right node in the positive direction of the second dimension to be the upper right node of the logical plane and assigning a node at a next hop away from the lower left node in the positive direction of the second dimension to be the upper left node of the logical plane.

### Claim 7 (depends on 3)

The method of claim 3, further comprising constructing a set of unique logical planes of the subcommunicator in dependence upon the logical planes established by each node.

### Claim 8

An apparatus for identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed, cause the apparatus to carry out the steps of:
identifying, by each compute node of the subcommunicator, all logical planes that include the compute node;
calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane;
initiating, by a root node of the subcommunicator, a gather operation;
receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and
identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.

### Claim 9 (depends on 8)

The apparatus of claim 8 further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of:
performing data communications amongst the compute nodes of the subcommunicator included in the logical plane have the greatest area including utilizing data communications techniques optimized for regular topologies.

### Claim 10 (depends on 8)

The apparatus of claim 8, wherein identifying, by each compute node of the subcommunicator, all logical planes that include the compute node further comprises:
for each compute node of the subcommunicator and iteratively, for a plurality of dimensions beginning with a first dimension:
establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, wherein the second dimension is orthogonal to the first dimension; and
establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein establishing, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, further comprises:
assigning the plane building node to be the lower left node of a logical plane of the sub communicator;
iteratively, beginning with a node one hop away from the lower left node in a positive direction of the first dimension until a node at a next hop away from the lower left node is not included in the subcommunicator:
assigning a node at a next hop away from the lower left node in the positive direction of the first dimension to be the lower right node of the logical plane of the subcommunicator; and
iteratively, beginning with nodes one hop away from the lower left node and lower right node in a positive direction of a second dimension until a node at a next hop away from the lower left or lower right node is not included in the subcommunicator: assigning a node at a next hop away from the lower left node in the positive direction of the second dimension to be the upper left node of the logical plane and assigning a node at a next hop away from the lower right node in the positive direction of the second dimension to be the upper right node of the logical plane.

### Claim 12 (depends on 10)

The apparatus of claim 10, wherein establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension, further comprises:
assigning the plane building node to be the lower right node of a logical plane of the sub communicator;
iteratively, beginning with a node one hop away from the lower right node in the negative direction of the first dimension until a node at a next hop away from the lower right node is not included in the subcommunicator:
assigning a node at a next hop away from the lower right node in the negative direction of the first dimension to be the lower left node of the logical plane of the subcommunicator; and
iteratively, beginning with a node one hop away from the lower right node and a node one hop away from the lower left node in the positive direction of the second dimension until a node at a next hop away from the lower right or lower left node is not included in the subcommunicator: assigning a node at a next hop away from the lower right node in the positive direction of the second dimension to be the upper right node of the logical plane and assigning a node at a next hop away from the lower left node in the positive direction of the second dimension to be the upper left node of the logical plane.

### Claim 13 (depends on 10)

The apparatus of claim 10, further comprising computer program instructions that, when executed, cause the apparatus to carry out the step of constructing a set of unique logical planes of the subcommunicator in dependence upon the logical planes established by each node.

### Claim 14

A computer program product for identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of:
identifying, by each compute node of the subcommunicator, all logical planes that include the compute node;
calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane;
initiating, by a root node of the subcommunicator, a gather operation;
receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and
identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.

### Claim 15 (depends on 14)

The computer program product of claim 14 further comprising computer program instructions that, when executed, cause the computer to carry out the step of:
performing data communications amongst the compute nodes of the subcommunicator included in the logical plane have the greatest area including utilizing data communications techniques optimized for regular topologies.

### Claim 16 (depends on 14)

The computer program product of claim 14, wherein identifying, by each compute node of the subcommunicator, all logical planes that include the compute node, further comprises:
for each compute node of the subcommunicator and iteratively, for a plurality of dimensions beginning with a first dimension:
establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, wherein the second dimension is orthogonal to the first dimension; and
establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.

### Claim 17 (depends on 14)

The computer program product of claim 14, wherein establishing, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, further comprises:
assigning the plane building node to be the lower left node of a logical plane of the sub communicator;
iteratively, beginning with a node one hop away from the lower left node in a positive direction of the first dimension until a node at a next hop away from the lower left node is not included in the subcommunicator:
assigning a node at a next hop away from the lower left node in the positive direction of the first dimension to be the lower right node of the logical plane of the subcommunicator; and
iteratively, beginning with nodes one hop away from the lower left node and lower right node in a positive direction of a second dimension until a node at a next hop away from the lower left or lower right node is not included in the subcommunicator: assigning a node at a next hop away from the lower left node in the positive direction of the second dimension to be the upper left node of the logical plane and assigning a node at a next hop away from the lower right node in the positive direction of the second dimension to be the upper right node of the logical plane.

### Claim 18 (depends on 14)

The computer program product of claim 14, wherein establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension, further comprises:
assigning the plane building node to be the lower right node of a logical plane of the sub communicator;
iteratively, beginning with a node one hop away from the lower right node in the negative direction of the first dimension until a node at a next hop away from the lower right node is not included in the subcommunicator:
assigning a node at a next hop away from the lower right node in the negative direction of the first dimension to be the lower left node of the logical plane of the subcommunicator; and
iteratively, beginning with a node one hop away from the lower right node and a node one hop away from the lower left node in the positive direction of the second dimension until a node at a next hop away from the lower right or lower left node is not included in the subcommunicator: assigning a node at a next hop away from the lower right node in the positive direction of the second dimension to be the upper right node of the logical plane and assigning a node at a next hop away from the lower left node in the positive direction of the second dimension to be the upper left node of the logical plane.

### Claim 19 (depends on 14)

The computer program product of claim 14, further comprising computer program instructions that, when executed, cause the computer to carry out the step of constructing a set of unique logical planes of the subcommunicator in dependence upon the logical planes established by each node.
