# Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

## Abstract

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

- Inventors:

- Rochester, MN
- Fayetteville, NC
- Eden Prairie, MN

- Issue Date:

- Research Org.:
- International Business Machines Corporation (Armonk, NY)

- Sponsoring Org.:
- USDOE

- OSTI Identifier:
- 988401

- Patent Number(s):
- 7,552,312

- Application Number:
- 11/672,989

- Assignee:
- International Business Machines Corporation (Armonk, NY) OSTI

- DOE Contract Number:
- B519700

- Resource Type:
- Patent

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 97 MATHEMATICS AND COMPUTING

### Citation Formats

```
Archer, Charles J, Hardwick, Camesha R, McCarthy, Patrick J, and Wallenfelt, Brian P.
```*Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node*. United States: N. p., 2009.
Web.

```
Archer, Charles J, Hardwick, Camesha R, McCarthy, Patrick J, & Wallenfelt, Brian P.
```*Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node*. United States.

```
Archer, Charles J, Hardwick, Camesha R, McCarthy, Patrick J, and Wallenfelt, Brian P. Tue .
"Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node". United States. https://www.osti.gov/servlets/purl/988401.
```

```
@article{osti_988401,
```

title = {Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node},

author = {Archer, Charles J and Hardwick, Camesha R and McCarthy, Patrick J and Wallenfelt, Brian P},

abstractNote = {Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.},

doi = {},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2009},

month = {6}

}