Performing a scatterv operation on a hierarchical tree network optimized for collective operations
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/28
H04L-012/44
G06F-015/16
G06F-015/173
출원번호
US-0748594
(2010-03-29)
등록번호
US-8565089
(2013-10-22)
발명자
/ 주소
Archer, Charles J.
Blocksome, Michael A.
Ratterman, Joseph D.
Smith, Brian E.
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Biggers & Ohanian, LLP
인용정보
피인용 횟수 :
15인용 특허 :
67
초록▼
Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scat
Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.
대표청구항▼
1. A method for performing a scatterv operation on a hierarchical tree network optimized for collective operations, the hierarchical tree network comprising a collection of compute nodes including a root node, each compute node having installed upon it a scatterv module, the method comprising: initi
1. A method for performing a scatterv operation on a hierarchical tree network optimized for collective operations, the hierarchical tree network comprising a collection of compute nodes including a root node, each compute node having installed upon it a scatterv module, the method comprising: initiating, by a scatterv module installed on the root node of the hierarchical tree network, the scatterv operation including sending a chunk of data to one or more nearest neighbor children of the root node;for each node other than the root node: receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node, the chunk of data, the chunk of data having at least a portion of data for the node;maintaining, by the scatterv module installed on the node, the portion of the data for the node;determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; andsending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child. 2. The method of claim 1 wherein determining whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprises determining whether any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the left of the node; and sending those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprises sending those portions of data to the nearest neighbor children node to the left if any portions of the data are for another node below the node in the hierarchy of the tree and to the left of the node. 3. The method of claim 1 wherein determining whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprises determining whether any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the right of the node; and sending those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprises sending those portions of data to the nearest neighbor children nodes to the right if any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the right of the node. 4. The method of claim 1 further comprising initiating, by a scatterv module installed on the root node of the hierarchical tree network, the scatterv operation including sending a chunk of data to one or more nearest neighbor children of the root. 5. The method of claim 1 wherein the tree network is a binary tree network. 6. An apparatus for performing a scatterv operation on a hierarchical tree network optimized for collective operations, the hierarchical tree network comprising a collection of compute nodes including a root node, each compute node having installed upon it a scatterv module, the apparatus comprising a computer processor and a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions capable of: initiating, by a scatterv module installed on the root node of the hierarchical tree network, the scatterv operation including sending a chunk of data to one or more nearest neighbor children of the root node;for each node other than the root node: receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node, the chunk of data, the chunk of data having at least a portion of data for the node;maintaining, by the scatterv module installed on the node, the portion of the data for the node;determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; andsending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child. 7. The apparatus of claim 6 wherein computer program instructions capable of determining whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of determining whether any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the left of the node; and computer program instructions capable of sending those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of sending those portions of data to the nearest neighbor children node to the left if any portions of the data are for another node below the node in the hierarchy of the tree and to the left of the node. 8. The apparatus of claim 6 wherein computer program instructions capable of determining whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of determining whether any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the right of the node; and computer program instructions capable of sending those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of sending those portions of data to the nearest neighbor children nodes to the right if any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the right of the node. 9. The apparatus of claim 6 wherein the computer memory also has disposed within it computer program instructions capable of initiating, by a scatterv module installed on the root node of the hierarchical tree network, the scatterv operation including sending a chunk of data to one or more nearest neighbor children of the root. 10. The apparatus of claim 6 wherein the tree network is a binary tree network. 11. A computer program product for performing a scatterv operation on a hierarchical tree network optimized for collective operations, the hierarchical tree network comprising a collection of compute nodes including a root node, each compute node having installed upon it a scatterv module, the computer program product disposed in a computer readable recording storage medium, the computer program product comprising computer program instructions capable of: initiating, by a scatterv module installed on the root node of the hierarchical tree network, the scatterv operation including sending a chunk of data to one or more nearest neighbor children of the root node;for each node other than the root node: receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node, the chunk of data, the chunk of data having at least a portion of data for the node;maintaining, by the scatterv module installed on the node, the portion of the data for the node;determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; andsending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child. 12. The computer program product of claim 11 wherein computer program instructions capable of determining whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of determining whether any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the left of the node; and computer program instructions capable of sending those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of sending those portions of data to the nearest neighbor children node to the left if any portions of the data are for another node below the node in the hierarchy of the tree and to the left of the node. 13. The computer program product of claim 11 wherein computer program instructions capable of determining whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of determining whether any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the right of the node; and computer program instructions capable of sending those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child further comprise computer program instructions capable of sending those portions of data to the nearest neighbor children nodes to the right if any portions of the data are for one or more other nodes below the node in the hierarchy of the tree and to the right of the node. 14. The computer program product of claim 11 further comprising computer program instructions capable of initiating, by a scatterv module installed on the root node of the hierarchical tree network, the scatterv operation including sending a chunk of data to one or more nearest neighbor children of the root. 15. The computer program product of claim 11 wherein the tree network is a binary tree network.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (67)
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.
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.
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.
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 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.; 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 data communications events by awakening threads in parallel active messaging interface of a parallel computer.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.