# Performing a local barrier operation

## Abstract

Performing a local barrier operation with parallel tasks executing on a compute node including, for each task: retrieving a present value of a counter; calculating, in dependence upon the present value of the counter and a total number of tasks performing the local barrier operation, a base value, the base value representing the counter's value prior to any task joining the local barrier; calculating, in dependence upon the base value and the total number of tasks performing the local barrier operation, a target value of the counter, the target value representing the counter's value when all tasks have joined the local barrier; joining the local barrier, including atomically incrementing the value of the counter; and repetitively, until the present value of the counter is no less than the target value of the counter: retrieving the present value of the counter and determining whether the present value equals the target value.

- Inventors:

- Publication Date:

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

- Sponsoring Org.:
- USDOE

- OSTI Identifier:
- 1126873

- Patent Number(s):
- 8,667,502

- Application Number:
- 13/683,616

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

- DOE Contract Number:
- B554331

- Resource Type:
- Patent

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 97 MATHEMATICS AND COMPUTING

### Citation Formats

```
Archer, Charles J, Blocksome, Michael A, Ratterman, Joseph D, and Smith, Brian E.
```*Performing a local barrier operation*. United States: N. p., 2014.
Web.

```
Archer, Charles J, Blocksome, Michael A, Ratterman, Joseph D, & Smith, Brian E.
```*Performing a local barrier operation*. United States.

```
Archer, Charles J, Blocksome, Michael A, Ratterman, Joseph D, and Smith, Brian E. Tue .
"Performing a local barrier operation". United States. https://www.osti.gov/servlets/purl/1126873.
```

```
@article{osti_1126873,
```

title = {Performing a local barrier operation},

author = {Archer, Charles J and Blocksome, Michael A and Ratterman, Joseph D and Smith, Brian E},

abstractNote = {Performing a local barrier operation with parallel tasks executing on a compute node including, for each task: retrieving a present value of a counter; calculating, in dependence upon the present value of the counter and a total number of tasks performing the local barrier operation, a base value, the base value representing the counter's value prior to any task joining the local barrier; calculating, in dependence upon the base value and the total number of tasks performing the local barrier operation, a target value of the counter, the target value representing the counter's value when all tasks have joined the local barrier; joining the local barrier, including atomically incrementing the value of the counter; and repetitively, until the present value of the counter is no less than the target value of the counter: retrieving the present value of the counter and determining whether the present value equals the target value.},

doi = {},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2014},

month = {3}

}

Works referenced in this record:

##
Message Flow Control in a Multi-Node Computer System

patent-application, December 2009

- Barsness, Eric L.; Darrington, David L.; Peters, Amanda
- US Patent Application 12/144783; 20090319621