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:
 Issue Date:
 Research Org.:
 International Business Machines Corp., Armonk, NY (United States)
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1126873
 Patent Number(s):
 8667502
 Application Number:
 13/683,616
 Assignee:
 International Business Machines Corporation (Armonk, NY)
 Patent Classifications (CPCs):

G  PHYSICS G06  COMPUTING G06F  ELECTRIC DIGITAL DATA PROCESSING
 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:
Interleaved alltoall reliable broadcast on meshes and hypercubes
journal, May 1994
 Sunggu Lee, ; Shin, K. G.
 IEEE Transactions on Parallel and Distributed Systems, Vol. 5, Issue 5
Efficient algorithms for alltoall communications in multiport messagepassing systems
journal, January 1997
 Bruck, J.; Kipnis, S.
 IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 11
Building packet buffers using interleaved memories
conference, January 2005
 Shrimali, G.; McKeown, N.
 HPSR. 2005 Workshop on High Performance Switching and Routing, 2005.