Determining collective barrier operation skew in a parallel computer

Faraj, Daniel A.

Title: Determining collective barrier operation skew in a parallel computer

Abstract

Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by: identifying, from the compute nodes' barrier completion times, a maximum barrier completion time and a minimum barrier completion time and calculating the barrier operation skew as the difference of the maximum and the minimum barrier completion time.

Inventors:: Faraj, Daniel A.

Issue Date:: 2015-11-24

Research Org.:: International Business Machines Corp., Armonk, NY (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1226811

Patent Number(s):: 9195517

Application Number:: 13/685,869

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

Patent Classifications (CPCs):: G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING

Show more

G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
G06F9/522 - {Barrier synchronisation}

Show less

DOE Contract Number:: B554331

Resource Type:: Patent

Resource Relation:: Patent File Date: 2012 Nov 27

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Citation Formats


                    Faraj, Daniel A. Determining collective barrier operation skew in a parallel computer.  United States: N. p., 2015. 
        Web.

Copy to clipboard


                    Faraj, Daniel A. Determining collective barrier operation skew in a parallel computer.  United States.

Copy to clipboard


                    Faraj, Daniel A. Tue .  
        "Determining collective barrier operation skew in a parallel computer".  United States.  https://www.osti.gov/servlets/purl/1226811.

Copy to clipboard


                    
@article{osti_1226811,

  title        = {Determining collective barrier operation skew in a parallel computer},

  author       = {Faraj, Daniel A.},

  abstractNote = {Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by: identifying, from the compute nodes' barrier completion times, a maximum barrier completion time and a minimum barrier completion time and calculating the barrier operation skew as the difference of the maximum and the minimum barrier completion time.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2015},

  month        = {11}

}

Copy to clipboard

Patent:

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

A Clock Synchronization Strategy for Minimizing Clock Variance at Runtime in High-End Computing Environments
conference, October 2010

Jones, Terry; Koenig, Gregory A.
2010 22nd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)
https://doi.org/10.1109/SBAC-PAD.2010.33

Replay-Based Synchronization of Timestamps in Event Traces of Massively Parallel Applications
conference, September 2008

Becker, Daniel; Linford, John C.; Rabenseifner, Rolf
2008 International Conference on Parallel Processing Workshops (ICPP-W), 2008 International Conference on Parallel Processing - Workshops
https://doi.org/10.1109/ICPP-W.2008.17

Probabilistic internal clock synchronization
conference, January 1994

Cristian, F.; Fetzer, C.
Proceedings of IEEE 13th Symposium on Reliable Distributed Systems
https://doi.org/10.1109/RELDIS.1994.336912

The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD
journal, July 1989

Gusella, R.; Zatti, S.
IEEE Transactions on Software Engineering, Vol. 15, Issue 7
https://doi.org/10.1109/32.29484

Similar Records in DOE Patents and OSTI.GOV collections:

Determining collective barrier operation skew in a parallel computer

Patent Faraj, Daniel A.

Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by:more » « less
Full Text Available
Determining when a set of compute nodes participating in a barrier operation on a parallel computer are ready to exit the barrier operation

Patent Blocksome, Michael A [Rochester, MN]

Methods, apparatus, and products are disclosed for determining when a set of compute nodes participating in a barrier operation on a parallel computer are ready to exit the barrier operation that includes, for each compute node in the set: initializing a barrier counter with no counter underflow interrupt; configuring, upon entering the barrier operation, the barrier counter with a value in dependence upon a number of compute nodes in the set; broadcasting, by a DMA engine on the compute node to each of the other compute nodes upon entering the barrier operation, a barrier control packet; receiving, by the DMAmore » « less
Full Text Available
Data communications for a collective operation in a parallel active messaging interface of a parallel computer

Patent Faraj, Daniel A.

Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks,more » « less
Full Text Available
Data communications for a collective operation in a parallel active messaging interface of a parallel computer

Patent Faraj, Daniel A

Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks,more » « less
Full Text Available
Performing optimized collective operations in a irregular subcommunicator of compute nodes in a parallel computer

Patent Davis, Kristan Suzanne D.; Faraj, Daniel A.

In a parallel computer, performing optimized collective operations in an irregular subcommunicator of compute nodes may be carried out by: identifying, within the irregular subcommunicator, regular neighborhoods of compute nodes; selecting, for each neighborhood from the compute nodes of the neighborhood, a local root node; assigning each local root node to a node of a neighborhood-wide tree topology; mapping, for each neighborhood, the compute nodes of the neighborhood to a local tree topology having, at its root, the local root node of the neighborhood; and performing a one way, rooted collective operation within the subcommunicator including: performing, in one phase,more » « less
Full Text Available

Similar Records

Title: Determining collective barrier operation skew in a parallel computer

Abstract

Citation Formats

A Clock Synchronization Strategy for Minimizing Clock Variance at Runtime in High-End Computing Environments conference, October 2010

Replay-Based Synchronization of Timestamps in Event Traces of Massively Parallel Applications conference, September 2008

Probabilistic internal clock synchronization conference, January 1994

The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD journal, July 1989

A Clock Synchronization Strategy for Minimizing Clock Variance at Runtime in High-End Computing Environments
conference, October 2010

Replay-Based Synchronization of Timestamps in Event Traces of Massively Parallel Applications
conference, September 2008

Probabilistic internal clock synchronization
conference, January 1994

The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD
journal, July 1989