Synchronizing compute node time bases in a parallel computer

Patent metadata

Field	Value
Publication number	US-8943350-B2
Application number	US-201213693894-A
Country	US
Kind code	B2
Filing date	Dec 4, 2012
Priority date	Dec 15, 2011
Publication date	Jan 27, 2015
Grant date	Jan 27, 2015

Abstract

Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

First claim

What is claimed is:

1. A method of synchronizing compute node time bases in a parallel computer, the compute nodes organized for data communications in a tree network, one compute node in the tree network designated as a root node, each compute node executing a plurality of threads, the method comprising:
for each compute node: calculating data transmission latency from the root node to the compute node, including: configuring the compute node to operate as a delayed node; enterin…

Assignees

• IBM

Inventors

• Chen Dong
• Faraj Daniel A
• Gooding Thomas M
• Heidelberger Philip

Classifications

• G06F1/12 Primary

  Physics · mapped topic

• H04L12/413 Primary

  Electricity · mapped topic