Minimally buffered data transfers between nodes in a data communications network
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
H04L-029/08
G06F-009/54
출원번호
US-0865981
(2007-10-02)
등록번호
US-9065839
(2015-06-23)
발명자
/ 주소
Miller, Douglas R.
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Biggers Kennedy Lenart Spraggins, LLP
인용정보
피인용 횟수 :
0인용 특허 :
83
초록▼
Methods, apparatus, and products for minimally buffered data transfers between nodes in a data communications network are disclosed that include: receiving, by a messaging module on an origin node, a storage identifier, a origin data type, and a target data type, the storage identifier specifying ap
Methods, apparatus, and products for minimally buffered data transfers between nodes in a data communications network are disclosed that include: receiving, by a messaging module on an origin node, a storage identifier, a origin data type, and a target data type, the storage identifier specifying application storage containing data, the origin data type describing a data subset contained in the origin application storage, the target data type describing an arrangement of the data subset in application storage on a target node; creating, by the messaging module, origin metadata describing the origin data type; selecting, by the messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the data subset; and transmitting, by the messaging module to the target node, the selected data subset for storing in the target application storage in dependence upon the target data type without temporarily buffering the data subset.
대표청구항▼
1. A method for minimally buffered data transfers between nodes in a data communications network, the method comprising: receiving, by an origin messaging module on an origin node from an application on the origin node, a storage identifier, a complex origin data type, and a complex target data type
1. A method for minimally buffered data transfers between nodes in a data communications network, the method comprising: receiving, by an origin messaging module on an origin node from an application on the origin node, a storage identifier, a complex origin data type, and a complex target data type, the storage identifier specifying origin application storage containing data on the origin node, the complex origin data type describing a subset of the data contained in the origin application storage, the complex target data type describing an arrangement of the subset of the data in target application storage on a target node;creating, by the origin messaging module, origin metadata describing the complex origin data type;selecting, by the origin messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the subset of the data for transmission to the target node; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without any type of buffering the subset of the data in a temporary buffer on the target node. 2. The method of claim 1 wherein: the complex target data type is the same as the complex origin data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises:contiguously storing the selected subset of the data in a temporary buffer on the origin node; andtransmitting, from the temporary buffer on the origin node in a single data transfer operation, the subset of the data along with the origin metadata describing the complex origin data type. 3. The method of claim 1 wherein: the method further comprises creating, by the origin messaging module, target metadata describing the complex target data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises:contiguously storing the selected subset of the data in a temporary buffer on the origin node, andtransmitting, from the temporary buffer on the origin node in multiple data transfer operations, the selected subset of the data according to the target metadata. 4. The method of claim 1 wherein: the method further comprises creating, by the origin messaging module, target metadata describing the complex target data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises transmitting, from the origin application storage in multiple data transfer operations, the selected subset of the data according to both the origin metadata and the target metadata. 5. The method of claim 1 wherein the origin metadata specifies, for each contiguous chunk of data described by the complex origin data type, an offset describing a location of the contiguous chunk in the origin application storage and a length describing the size of the contiguous chunk. 6. The method of claim 1 wherein the origin compute node and the target compute node are comprised in a parallel computer, the parallel computer comprising a plurality of compute nodes connected for data communications through a plurality of data communications networks, at least one of the plurality of data communications networks optimized for point to point data communications, and at least one of the plurality of data communications networks optimized for collective operations. 7. An apparatus for minimally buffered data transfers between nodes in a data communications network, the apparatus comprising a computer processor and computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions capable of: receiving, by an origin messaging module on an origin node from an application on the origin node, a storage identifier, a complex origin data type, and a complex target data type, the storage identifier specifying origin application storage containing data on the origin node, the complex origin data type describing a subset of the data contained in the origin application storage, the complex target data type describing an arrangement of the subset of the data in target application storage on a target node;creating, by the origin messaging module, origin metadata describing the complex origin data type;selecting, by the origin messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the subset of the data for transmission to the target node; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without any type of buffering the subset of the data in a temporary buffer on the target node. 8. The apparatus of claim 7 wherein: the complex target data type is the same as the complex origin data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises:contiguously storing the selected subset of the data in a temporary buffer on the origin node; andtransmitting, from the temporary buffer on the origin node in a single data transfer operation, the subset of the data along with the origin metadata describing the complex origin data type. 9. The apparatus of claim 7 wherein: the computer memory has disposed within it computer program instructions capable of creating, by the origin messaging module, target metadata describing the complex target data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage according to the target metadata to select the subset of data to be transmitted without buffering the subset of the data in a temporary buffer on the target node further comprises:contiguously storing the selected subset of the data in a temporary buffer on the origin node, andtransmitting, from the temporary buffer on the origin node in multiple data transfer operations, the selected subset of the data according to the target metadata. 10. The apparatus of claim 7 wherein: the computer memory has disposed within it computer program instructions capable of creating, by the origin messaging module, target metadata describing the complex target data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises transmitting, from the origin application storage in multiple data transfer operations, the selected subset of the data according to both the origin metadata and the target metadata. 11. The apparatus of claim 7 wherein the origin metadata specifies, for each contiguous chunk of data described by the complex origin data type, an offset describing a location of the contiguous chunk in the origin application storage and a length describing the size of the contiguous chunk. 12. The apparatus of claim 7 wherein the origin compute node and the target compute node are comprised in a parallel computer, the parallel computer comprising a plurality of compute nodes connected for data communications through a plurality of data communications networks, at least one of the plurality of data communications networks optimized for point to point data communications, and at least one of the plurality of data communications networks optimized for collective operations. 13. A computer program product for minimally buffered data transfers between nodes in a data communications network, the computer program product disposed upon a computer readable, recordable medium, the computer program product comprising computer program instructions capable of: receiving, by an origin messaging module on an origin node from an application on the origin node, a storage identifier, a complex origin data type, and a complex target data type, the storage identifier specifying origin application storage containing data on the origin node, the complex origin data type describing a subset of the data contained in the origin application storage, the complex target data type describing an arrangement of the subset of the data in target application storage on a target node;creating, by the origin messaging module, origin metadata describing the complex origin data type;selecting, by the origin messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the subset of the data for transmission to the target node; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without any type of buffering the subset of the data in a temporary buffer on the target node. 14. The computer program product of claim 13 wherein: the complex target data type is the same as the complex origin data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises:contiguously storing the selected subset of the data in a temporary buffer on the origin node; andtransmitting, from the temporary buffer on the origin node in a single data transfer operation, the subset of the data along with the origin metadata describing the complex origin data type. 15. The computer program product of claim 13 wherein: the computer program product further comprises computer program instructions capable of creating, by the origin messaging module, target metadata describing the complex target data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage according to the target metadata without buffering the subset of the data in a temporary buffer on the target node further comprises:contiguously storing the selected subset of the data in a temporary buffer on the origin node, andtransmitting, from the temporary buffer on the origin node in multiple data transfer operations, the selected subset of the data according to the target metadata. 16. The computer program product of claim 13 wherein: the computer program product further comprises computer program instructions capable of creating, by the origin messaging module, target metadata describing the complex target data type; andtransmitting, by the origin messaging module to a target messaging module on the target node, the selected subset of the data for storing in the target application storage in dependence upon the complex target data type without buffering the subset of the data in a temporary buffer on the target node further comprises transmitting, from the origin application storage in multiple data transfer operations, the selected subset of the data according to both the origin metadata and the target metadata. 17. The computer program product of claim 13 wherein the origin metadata specifies, for each contiguous chunk of data described by the complex origin data type, an offset describing a location of the contiguous chunk in the origin application storage and a length describing the size of the contiguous chunk. 18. The computer program product of claim 13 wherein the origin compute node and the target compute node are comprised in a parallel computer, the parallel computer comprising a plurality of compute nodes connected for data communications through a plurality of data communications networks, at least one of the plurality of data communications networks optimized for point to point data communications, and at least one of the plurality of data communications networks optimized for collective operations.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (83)
Cavanagh,Carl; Sivier,Steven A., Applying distributed simulation techniques to hardware emulation.
Gorin Allen L. (Fairlawn NJ) Lewine Robert N. (Hanover Township ; Morris County NJ) Makofsky Patrick A. (Randolph NJ) Shively Richard R. (Convent Station NJ), Binary tree multiprocessor.
Wingard Drew E. ; Rosseel Geert Paul ; Tomlinson Jay S. ; Robinson Lisa A., Communications system and method with multilevel connection identification.
Wingard, Drew Eric; Rosseel, Geert Paul; Tomlinson, Jay S.; Robinson, Lisa A., Communications system and method with multilevel connection identification.
Willis John Christopher ; Newshutz Robert Neill, Compiler-oriented apparatus for parallel compilation, simulation and execution of computer programs and hardware models.
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.
Blackard Joe Wayne ; Gillaspy Richard Adams ; Henthorn William John ; Petersen Lynn Erich ; Russell Lance W. ; Shippy Gary Roy, Data processing system and method for pacing information transfers in a communications network.
Basso, Claude; Calvignac, Jean Louis; Heddes, Marco C.; Logan, Joseph Franklin; Verplanken, Fabrice Jean, Data structures for efficient processing of multicast transmissions.
Kloth,Axel K.; Andrews,Warner; Bergantino,Paul; Bicknell,Jeremy; Fu,Daniel; De Leon,Moshe; Mills,Stephen M., Dynamic bandwidth allocation for wide area networks.
Barzilai Tsipora P. (Millwood NY) Chen Mon-Song (Katonah NY) Kadaba Bharath K. (Peekskill NY) Kaplan Marc A. (Purdys NY), Flow control for high speed networks.
Blackmore, Robert S.; Chang, Fu Chung; Chaudhary, Piyush; Gildea, Kevin J.; Goscinski, Jason E.; Govindaraju, Rama K.; Grice, Donald G.; Helmer, Jr., Leonard W.; Heywood, Patricia E.; Hochschild, Peter H.; Houston, John S.; Kim, Chulho; Martin, Steven J., Half RDMA and half FIFO operations.
Burns, Randal Chilton; Goel, Atul; Long, Darrell D. E.; Rees, Robert Michael, Lease based safety protocol for distributed system with multiple networks.
Richard Alan Diedrich ; Harvey Gene Kiel, Method and apparatus for multimedia data interchange with pacing capability in a distributed data processing system.
Shtayer Ronen (Tel-Aviv ILX) Alon Naveh (Ranat Hashnron ILX) Alexander Joffe (Rehovot ILX), Method and apparatus for pacing asynchronous transfer mode (ATM) data cell transmission.
Crawley Eric S. ; Zhang Zhaohui ; Salkewicz William M. ; Sanchez Cheryl A., Method and apparatus for providing quality of service routing in a network.
Levin Vladimir K.,RUX ; Karatanov Vjacheslav V.,RUX ; Jalin Valerii V.,RUX ; Titov Alexandr,RUX ; Agejev Vjacheslav M.,RUX ; Patrikeev Andrei,RUX ; Jablonsky Sergei V.,RUX ; Korneev Victor V.,RUX ; M, Method for deadlock-free message passing in MIMD systems using routers and buffers.
Arimilli, Lakshminarayana B.; Arimilli, Ravi K.; Rajamony, Ramakrishnan; Speight, William E., Performing collective operations using software setup and partial software execution at leaf nodes in a multi-tiered full-graph interconnect architecture.
Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E., Reducing power consumption while performing collective operations on a plurality of compute nodes.
Daruwalla, Feisal; Forster, James R.; Roeck, Guenter E.; Woundy, Richard M.; Thomas, Michael A., Routing protocol based redundancy design for shared-access networks.
Ray, Amar N.; Bugenhagen, Michael K.; Morrill, Robert J.; Chakravarthy, Cadathur V., System and method for adjusting the window size of a TCP packet through network elements.
Blandy Geoffrey Owen ; Saba Maher Afif, System and method for instruction burst performance profiling for single-processor and multi-processor systems.
Schumacher, Larry Lee; Gonzales-Tuchmann, Agustin; Yogman, Laurence Tobin; Dingman, Paul C., System for deadlock condition detection and correction by allowing a queue limit of a number of data tokens on the queue to increase.
Levy Henry M. ; Feeley Michael J.,CAX ; Karlin Anna R. ; Morgan William E. ; Thekkath Chandramohan A., Using global memory information to manage memory in a computer network.
Advani Deepak Mohan ; Byron Michael Justin ; Hansell Steven Robert ; Ming Chun Li Todd ; Marino John Paul ; Panda Rajendra Datta ; Pierce James Andrew ; Wang Ko-Yang ; Weinel Dennis George ; Welch Ro, Visualization tool for graphically displaying trace data.
Advani Deepak Mohan ; Byron Michael Justin ; Hansell Steven Robert ; Li Todd Ming Chun ; Marino John Paul ; Panda Rajendra Datta ; Pierce James Andrew ; Wang Ko-Yang ; Weinel Dennis George ; Welch Ro, Visualization tool for graphically displaying trace data produced by a parallel processing computer.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.