Performing an allreduce operation on a plurality of compute nodes of a parallel computer
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/80
G06F-009/30
G06F-009/302
출원번호
US-0124756
(2008-05-21)
등록번호
US-8161268
(2012-04-17)
발명자
/ 주소
Faraj, Ahmad
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Biggers & Ohanian, LLP
인용정보
피인용 횟수 :
29인용 특허 :
36
초록▼
Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer. Each compute node includes at least two processing cores. Each processing core has contribution data for the allreduce operation. Performing an allreduce opera
Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer. Each compute node includes at least two processing cores. Each processing core has contribution data for the allreduce operation. Performing an allreduce operation on a plurality of compute nodes of a parallel computer includes: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node; performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; and performing, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node.
대표청구항▼
1. A method of performing an allreduce operation on a plurality of compute nodes of a parallel computer, each compute node comprising at least two processing cores, each processing core having contribution data for the allreduce operation, the method comprising: establishing one or more logical ring
1. A method of performing an allreduce operation on a plurality of compute nodes of a parallel computer, each compute node comprising at least two processing cores, each processing core having contribution data for the allreduce operation, the method comprising: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node, wherein in a logical ring, all data that is transferred between processing cores travels from one core of one node to a next core in a next node in a circular manner;performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node. 2. The method of claim 1 wherein performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the global allreduce result for each processing core included in that logical ring, yielding reduce scatter result for each processing core; andperforming, for each logical ring, an allgather operation using the reduce scatter result for each processing core included in that logical ring, yielding the global allreduce result for each processing core. 3. The method of claim 1 further comprising assigning, on each compute node, the processing cores on that compute node to one of a plurality of logical ring domains. 4. The method of claim 3 wherein: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node further comprises selecting, for each logical ring domain, one of the processing cores assigned to that logical ring domain as the representative core for that logical ring domain; andperforming, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the contribution data for each representative core included in that logical ring, yielding a reduce scatter result for each representative core, and performing, for each logical ring, an allgather operation using the reduce scatter result for each representative core included in that logical ring, yielding the global allreduce result for each representative core; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node further comprises performing, for each logical ring domain for each compute node, the local allreduce operation using the global allreduce result for each processing core assigned to that logical ring domain. 5. The method of claim 3 wherein: each logical ring domain corresponds to one of the logical rings;establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node further comprises assigning, for each logical ring domain for each compute node, all of the processing cores of that logical ring domain to the logical ring corresponding to that logical ring domain;performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the contribution data for each processing core included in that logical ring, yielding a reduce scatter result for each processing core, and performing, for each logical ring, an allgather operation using the reduce scatter result for each processing core included in that logical ring, yielding the global allreduce result for each processing core; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node further comprises performing, for each compute node, the local allreduce operation using the global allreduce result for processing cores assigned to different logical ring domains for that compute node. 6. The method of claim 1 wherein the compute nodes are connected using a data communications network having multiple dimensions and each logical ring corresponds to one of the dimensions of the data communications network. 7. A parallel computer for performing an allreduce operation on a plurality of compute nodes, each compute node comprising at least two processing cores, each processing core having contribution data for the allreduce operation, the parallel computer comprising computer memory operatively coupled to the processing cores of the parallel computer, the computer memory having disposed within it computer program instructions capable of: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node, wherein in a logical ring, all data that is transferred between processing cores travels from one core of one node to a next core in a next node in a circular manner;performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node. 8. The parallel computer of claim 7 wherein performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the global allreduce result for each processing core included in that logical ring, yielding reduce scatter result for each processing core; andperforming, for each logical ring, an allgather operation using the reduce scatter result for each processing core included in that logical ring, yielding the global allreduce result for each processing core. 9. The parallel computer of claim 7 wherein the computer memory has disposed within it computer program instructions capable of assigning, on each compute node, the processing cores on that compute node to one of a plurality of logical ring domains. 10. The parallel computer of claim 9 wherein: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node further comprises selecting, for each logical ring domain, one of the processing cores assigned to that logical ring domain as the representative core for that logical ring domain; andperforming, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the contribution data for each representative core included in that logical ring, yielding a reduce scatter result for each representative core, and performing, for each logical ring, an allgather operation using the reduce scatter result for each representative core included in that logical ring, yielding the global allreduce result for each representative core; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node further comprises performing, for each logical ring domain for each compute node, the local allreduce operation using the global allreduce result for each processing core assigned to that logical ring domain. 11. The parallel computer of claim 9 wherein: each logical ring domain corresponds to one of the logical rings;establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node further comprises assigning, for each logical ring domain for each compute node, all of the processing cores of that logical ring domain to the logical ring corresponding to that logical ring domain;performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the contribution data for each processing core included in that logical ring, yielding a reduce scatter result for each processing core, and performing, for each logical ring, an allgather operation using the reduce scatter result for each processing core included in that logical ring, yielding the global allreduce result for each processing core; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node further comprises performing, for each compute node, the local allreduce operation using the global allreduce result for processing cores assigned to different logical ring domains for that compute node. 12. The parallel computer of claim 7 wherein the compute nodes are connected using a data communications network having multiple dimensions and each logical ring corresponds to one of the dimensions of the data communications network. 13. A computer program product for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each compute node comprising at least two processing cores, each processing core having contribution data for the allreduce operation, the computer program product disposed upon a computer readable recordable medium, the computer program product comprising computer program instructions capable of: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node, wherein in a logical ring, all data that is transferred between processing cores travels from one core of one node to a next core in a next node in a circular manner;performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node. 14. The computer program product of claim 13 wherein performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the global allreduce result for each processing core included in that logical ring, yielding reduce scatter result for each processing core; andperforming, for each logical ring, an allgather operation using the reduce scatter result for each processing core included in that logical ring, yielding the global allreduce result for each processing core. 15. The computer program product of claim 13 further comprising computer program instructions capable of assigning, on each compute node, the processing cores on that compute node to one of a plurality of logical ring domains. 16. The computer program product of claim 15 wherein: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node further comprises selecting, for each logical ring domain, one of the processing cores assigned to that logical ring domain as the representative core for that logical ring domain; andperforming, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the contribution data for each representative core included in that logical ring, yielding a reduce scatter result for each representative core, and performing, for each logical ring, an allgather operation using the reduce scatter result for each representative core included in that logical ring, yielding the global allreduce result for each representative core; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node further comprises performing, for each logical ring domain for each compute node, the local allreduce operation using the global allreduce result for each processing core assigned to that logical ring domain. 17. The computer program product of claim 15 wherein: each logical ring domain corresponds to one of the logical rings;establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node further comprises assigning, for each logical ring domain for each compute node, all of the processing cores of that logical ring domain to the logical ring corresponding to that logical ring domain;performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring further comprises: performing, for each logical ring, a reduce scatter operation using the contribution data for each processing core included in that logical ring, yielding a reduce scatter result for each processing core, and performing, for each logical ring, an allgather operation using the reduce scatter result for each processing core included in that logical ring, yielding the global allreduce result for each processing core; andperforming, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node further comprises performing, for each compute node, the local allreduce operation using the global allreduce result for processing cores assigned to different logical ring domains for that compute node. 18. The computer program product of claim 13 wherein the compute nodes are connected using a data communications network having multiple dimensions and each logical ring corresponds to one of the dimensions of the data communications network.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (36)
Scott Steven L. ; Pribnow Richard D. ; Logghe Peter G. ; Kunkel Daniel L. ; Schwoerer Gerald A., Adaptive congestion control mechanism for modular computer networks.
Kato Sadayuki,JPX ; Ishihata Hiroaki,JPX ; Horie Takeshi,JPX ; Inano Satoshi,JPX ; Shimizu Toshiyuki,JPX, Data gathering/scattering system for a plurality of processors in a parallel computer.
Michael Olivier, Dynamically matching users for group communications based on a threshold degree of matching of sender and recipient predetermined acceptance criteria.
Cypher Robert E. (Los Gatos CA) Sanz Jorge L. C. (Los Gatos CA), Hierarchical interconnection network architecture for parallel processing, having interconnections between bit-addressib.
Flaig Charles M. (Pasadena CA) Seitz Charles L. (San Luis Rey CA), Inter-computer message routing system with each computer having separate routinng automata for each dimension of the net.
Carmichael Richard D. ; Ward Joel M. ; Winchell Michael A., Method and apparatus for controlling (N+I) I/O channels with (N) data managers in a homogenous software programmable en.
Krishnamoorthy Ashok V. (11188 Caminito Rodar San Diego CA 92126) Kiamilev Fouad (c/o UNC Charlotte ; Dept. of EE ; Smith Hall Room 332 Charlotte NC 28223), Packet-switched self-routing multistage interconnection network having contention-free fanout, low-loss routing, and fan.
Yasuda Yoshiko,JPX ; Tanaka Teruo,JPX, Parallel computer system using properties of messages to route them through an interconnect network and to select virtua.
Wilkinson Paul Amba ; Dieffenderfer James Warren ; Kogge Peter Michael ; Schoonover Nicholas Jerome, Partitioning of processing elements in a SIMD/MIMD array processor.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Effecting hardware acceleration of broadcast operations in a parallel computer.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Improving efficiency of a global barrier operation in a parallel computer.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Performing a deterministic reduction operation in a compute node organized into a branched tree topology.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Performing a deterministic reduction operation in a parallel computer.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Performing a deterministic reduction operation in a parallel computer.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Performing a scatterv operation on a hierarchical tree network optimized for collective operations.
Archer, Charles J.; Peters, Amanda E.; Smith, Brian E., Performing an all-to-all data exchange on a plurality of data buffers by performing swap operations.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Processing communications events in parallel active messaging interface by awakening thread from wait state.
Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E., Processing data communications events by awakening threads in parallel active messaging interface of a parallel computer.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.