Invention Grant
- Patent Title: Performing a deterministic reduction operation in a compute node organized into a branched tree topology
- Patent Title (中): 在组织成分支树拓扑的计算节点中执行确定性简化操作
-
Application No.: US12790037Application Date: 2010-05-28
-
Publication No.: US08489859B2Publication Date: 2013-07-16
- Inventor: Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
- Applicant: Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Biggers & Ohanian LLP
- Main IPC: G06F9/00
- IPC: G06F9/00

Abstract:
Performing a deterministic reduction operation in a parallel computer that includes compute nodes, each of which includes computer processors and a CAU (Collectives Acceleration Unit) that couples computer processors to one another for data communications, including organizing processors and a CAU into a branched tree topology in which the CAU is a root and the processors are children; receiving, from each of the processors in any order, dummy contribution data, where each processor is restricted from sending any other data to the root CAU prior to receiving an acknowledgement of receipt from the root CAU; sending, by the root CAU to the processors in the branched tree topology, in a predefined order, acknowledgements of receipt of the dummy contribution data; receiving, by the root CAU from the processors in the predefined order, the processors' contribution data to the reduction operation; and reducing, by the root CAU, the processors' contribution data.
Public/Granted literature
- US20110296139A1 Performing A Deterministic Reduction Operation In A Parallel Computer Public/Granted day:2011-12-01
Information query