Broadcasting a message in a parallel computer
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/28
H04L-012/56
G06F-009/54
H04L-029/08
출원번호
US-0861963
(2013-04-12)
등록번호
US-8891408
(2014-11-18)
발명자
/ 주소
Archer, Charles J.
Faraj, Daniel A.
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Biggers Kennedy Lenart Spraggins LLP
인용정보
피인용 횟수 :
0인용 특허 :
92
초록▼
Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the
Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.
대표청구항▼
1. A method of broadcasting a message in a parallel computer, the parallel computer comprising a plurality of compute nodes connected together using a multicast data communications network, the multicast data communications network optimized for collective operations, one compute node configured as
1. A method of broadcasting a message in a parallel computer, the parallel computer comprising a plurality of compute nodes connected together using a multicast data communications network, the multicast data communications network optimized for collective operations, one compute node configured as a physical root in the data communications network, the compute nodes organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer, and one compute node assigned to be a logical root for the operational group, the plurality of compute nodes comprising a plurality computer processors and computer memory operatively coupled to the computer processors, the method comprising: transmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group, wherein the logical root and the physical root are different compute nodes within the parallel computer; andfor each compute node in the operational group except the logical root: receiving, by that compute node, the message for broadcasting to all of the compute nodes in the operational group;if that compute node is the physical root, then transmitting, by that compute node, the message to all of the child nodes of the physical root except the child node from which the message was received;if that compute node received the message from the parent node for that compute node and if that compute node is not a leaf node, then transmitting, by that compute node, the message to all of the child nodes of that compute node; andif that compute node received the message from a child node and if that compute node is not the physical root, then transmitting concurrently, by that compute node, the message to the parent node of that compute node and all of the child nodes of that compute node except the child node from which the message was received. 2. The method of claim 1 wherein: the logical root is not a leaf node; andtransmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group further comprises transmitting the message to all of the child nodes of the logical root and to the parent node of the logical root. 3. The method of claim 1 wherein: the logical root is a leaf node; andtransmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group further comprises transmitting the message to the parent of the logical root. 4. The method of claim 1 wherein the multicast data communications network connects the plurality of compute nodes together in a tree topology. 5. A parallel computer for broadcasting a message in the parallel computer, the parallel computer comprising a plurality of compute nodes connected together using a multicast data communications network, the multicast data communications network optimized for collective operations, one compute node configured as a physical root in the data communications network, the compute nodes organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer, and one compute node assigned to be a logical root for the operational group, the plurality of compute nodes comprising a plurality computer processors and computer memory operatively coupled to the computer processors, the computer memory having disposed within it computer program instructions capable of: transmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group, wherein the logical root and the physical root are different compute nodes within the parallel computer; andfor each compute node in the operational group except the logical root: receiving, by that compute node, the message for broadcasting to all of the compute nodes in the operational group;if that compute node is the physical root, then transmitting, by that compute node, the message to all of the child nodes of the physical root except the child node from which the message was received;if that compute node received the message from the parent node for that compute node and if that compute node is not a leaf node, then transmitting, by that compute node, the message to all of the child nodes of that compute node; andif that compute node received the message from a child node and if that compute node is not the physical root, then transmitting concurrently, by that compute node, the message to the parent node of that compute node and all of the child nodes of that compute node except the child node from which the message was received. 6. The parallel computer of claim 5 wherein: the logical root is not a leaf node; andtransmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group further comprises transmitting the message to all of the child nodes of the logical root and to the parent node of the logical root. 7. The parallel computer of claim 5 wherein: the logical root is a leaf node; andtransmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group further comprises transmitting the message to the parent of the logical root. 8. The parallel computer of claim 5 wherein the multicast data communications network connects the plurality of compute nodes together in a tree topology. 9. A computer program product for broadcasting a message in a parallel computer, the parallel computer comprising a plurality of compute nodes connected together using a multicast data communications network, the multicast data communications network optimized for collective operations, one compute node configured as a physical root in the data communications network, the compute nodes organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer, and one compute node assigned to be a logical root for the operational group, the computer program product disposed upon a recordable computer readable medium, the computer program product comprising computer program instructions capable of: transmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group, wherein the logical root and the physical root are different compute nodes within the parallel computer; andfor each compute node in the operational group except the logical root: receiving, by that compute node, the message for broadcasting to all of the compute nodes in the operational group;if that compute node is the physical root, then transmitting, by that compute node, the message to all of the child nodes of the physical root except the child node from which the message was received;if that compute node received the message from the parent node for that compute node and if that compute node is not a leaf node, then transmitting, by that compute node, the message to all of the child nodes of that compute node; andif that compute node received the message from a child node and if that compute node is not the physical root, then transmitting concurrently, by that compute node, the message to the parent node of that compute node and all of the child nodes of that compute node except the child node from which the message was received. 10. The computer program product of claim 9 wherein: the logical root is not a leaf node; andtransmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group further comprises transmitting the message to all of the child nodes of the logical root and to the parent node of the logical root. 11. The computer program product of claim 9 wherein: the logical root is a leaf node; andtransmitting, by the logical root to all of the compute nodes in the operational group directly connected to the logical root, a message for broadcasting to all of the compute nodes in the operational group further comprises transmitting the message to the parent of the logical root. 12. The computer program product of claim 9 wherein the multicast data communications network connects the plurality of compute nodes together in a tree topology.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (92)
Scott Steven L. ; Pribnow Richard D. ; Logghe Peter G. ; Kunkel Daniel L. ; Schwoerer Gerald A., Adaptive congestion control mechanism for modular computer networks.
Archer, Charles J.; Inglett, Todd A.; Ratterman, Joseph D.; Smith, Brian E., Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective 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.
Connor, Patrick L.; McVay, Robert G., Direct memory access transfer reduction method and apparatus to overlay data on to scatter gather descriptors for bus-mastering I/O controllers.
Michael Olivier, Dynamically matching users for group communications based on a threshold degree of matching of sender and recipient predetermined acceptance criteria.
Archer, Charles J.; Ratterman, Joseph D., Executing scatter operation to parallel computer nodes by repeatedly broadcasting content of send buffer partition corresponding to each node upon bitwise OR operation.
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.
Blumrich, Matthias A.; Chen, Dong; Chiu, George L.; Cipolla, Thomas M.; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Kopcsay, Gerard V.; Mok, Lawrence S.; Takken, Todd E., Massively parallel supercomputer.
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.
Rangarajan, Vijay; Maniyar, Shyamsundar N.; Eatherton, William N., Method and apparatus for storing tree data structures among and within multiple memory channels.
Rangarajan,Vijay; Maniyar,Shyamsundar N.; Eatherton,William N., Method and apparatus for storing tree data structures among and within multiple memory channels.
Rodgers,Dion; Marr,Deborah T.; Hill,David L.; Kaushik,Shiv; Crossland,James B.; Koufaty,David A., Method and apparatus for suspending execution of a thread until a specified memory access occurs.
Archer, Charles J.; Carey, James E.; Markland, Matthew W.; Sanders, Philip J., Monitoring operating parameters in a distributed computing system with active messages.
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., Performing a scatterv operation on a hierarchical tree network optimized for collective operations.
VanHuben Gary Alan ; Blake Michael A. ; Mak Pak-kin, SMP clusters with remote resource managers for distributing work to other clusters while reducing bus traffic to a minimum.
Kil, David H.; Pottschmidt, David B., System and method for automatic generation of a hierarchical tree network and the use of two complementary learning algorithms, optimized for each leaf of the hierarchical tree network.
Papakipos, Matthew N.; Grant, Brian K.; McGuire, Morgan S.; Demetriou, Christopher G., Systems and methods for determining compute kernels for an application in a parallel-processing computer system.
Mahesh N. Ganmukhi ; Jeffrey V. Hill ; Monica C. Wong-Chan ; David C. Douglas, Tree network including arrangement for establishing sub-tree having a logical root below the network's physical root.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.