Administering an epoch initiated for remote memory access
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/173
G06F-003/00
G06F-015/16
G06F-013/00
G06F-013/28
출원번호
US-0491733
(2012-06-08)
등록번호
US-8346928
(2013-01-01)
발명자
/ 주소
Blocksome, Michael A.
Miller, Douglas R.
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Biggers & Ohanian, LLP
인용정보
피인용 횟수 :
0인용 특허 :
45
초록▼
Methods, systems, and products are disclosed for administering an epoch initiated for remote memory access that include: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch; initiating, by the origin appli
Methods, systems, and products are disclosed for administering an epoch initiated for remote memory access that include: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch; initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch, including rejecting any new data transfers after initiating the closing stage for the epoch; determining, by the origin application messaging module, whether the data transfers have completed; and closing, by the origin application messaging module, the epoch if the data transfers have completed.
대표청구항▼
1. A method of administering an epoch initiated for remote memory access, the method comprising: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch;initiating, by the origin application messaging module a
1. A method of administering an epoch initiated for remote memory access, the method comprising: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch;initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch, including rejecting any new data transfers after initiating the closing stage for the epoch and prior to closing the epoch;closing, by the origin application messaging module, the epoch after the data transfers have completed;wherein:each data transfer is effected using a get operation;initiating, by an origin application messaging module on a origin compute node, one or more data transfers to a target compute node for the epoch further comprises incrementing a get counter upon initiation of the get operation for each data transfer;the method further comprises decrementing, by the origin application messaging module, the get counter upon completion of each get operation; anddetermining, by the origin application messaging module, whether the data transfers have completed further comprises determining whether a value of the get counter is zero. 2. The method of claim 1 wherein initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises initiating the closing stage for the epoch before the data transfers are complete. 3. The method of claim 1 wherein initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises initiating the closing stage for the epoch after the data transfers are completed. 4. The method of claim 1 wherein: each data transfer is effected using a put operation;initiating, by an origin application messaging module on a origin compute node, one or more data transfers to a target compute node for the epoch further comprises incrementing a put counter upon initiation of the put operation for each data transfer;the method further comprises incrementing, by a target application messaging module on the target compute node, a got counter upon completion of each put operation;initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises sending a value of the put counter to the target compute node;the method further comprises:determining, by the target application messaging module, whether the value of the put counter matches a value of the got counter, andsending, by the target application messaging module to the origin application messaging module, a completion acknowledgement if the value of the put counter matches the value of the got counter; anddetermining, by the origin application messaging module, whether the data transfers have completed further comprises determining whether the completion acknowledgement has been received in the origin compute node. 5. 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 data communications network, the data communications network optimized for point to point data communications. 6. A system capable of administering an epoch initiated for remote memory access, the system comprising one or more computer processors, computer memory operatively coupled to the computer processors, the computer memory having disposed within it computer program instructions capable of: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch;initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch, including rejecting any new data transfers after initiating the closing stage for the epoch and prior to closing the epoch;closing, by the origin application messaging module, the epoch after the data transfers have completed;wherein:each data transfer is effected using a get operation;initiating, by an origin application messaging module on a origin compute node, one or more data transfers to a target compute node for the epoch further comprises incrementing a get counter upon initiation of the get operation for each data transfer;the computer memory also has disposed within it computer program instructions capable of decrementing, by the origin application messaging module, the get counter upon completion of each get operation; anddetermining, by the origin application messaging module, whether the data transfers have completed further comprises determining whether a value of the get counter is zero. 7. The system of claim 6 wherein initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises initiating the closing stage for the epoch before the data transfers are complete. 8. The system of claim 6 wherein initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises initiating the closing stage for the epoch after the data transfers are completed. 9. The system of claim 6 wherein: each data transfer is effected using a put operation;initiating, by an origin application messaging module on a origin compute node, one or more data transfers to a target compute node for the epoch further comprises incrementing a put counter upon initiation of the put operation for each data transfer;the computer memory also has disposed within it computer program instructions capable of incrementing, by a target application messaging module on the target compute node, a got counter upon completion of each put operation;initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises sending a value of the put counter to the target compute node;the computer memory also has disposed within it computer program instructions capable of:determining, by the target application messaging module, whether the value of the put counter matches a value of the got counter, andsending, by the target application messaging module to the origin application messaging module, a completion acknowledgement if the value of the put counter matches the value of the got counter; anddetermining, by the origin application messaging module, whether the data transfers have completed further comprises determining whether the completion acknowledgement has been received in the origin compute node. 10. The system of claim 6 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 data communications network, the data communications network optimized for point to point data communications. 11. A computer program product for administering an epoch initiated for remote memory access, the computer program product comprising a computer readable non-transmission medium, the computer readable non-transmission medium comprising computer program instructions capable of: initiating, by an origin application messaging module on an origin compute node, one or more data transfers to a target compute node for the epoch;initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch, including rejecting any new data transfers after initiating the closing stage for the epoch and prior to closing the epoch;closing, by the origin application messaging module, the epoch after the data transfers have completed;wherein:each data transfer is effected using a get operation;initiating, by an origin application messaging module on a origin compute node, one or more data transfers to a target compute node for the epoch further comprises incrementing a get counter upon initiation of the get operation for each data transfer;the computer program product further comprises computer program instructions capable of decrementing, by the origin application messaging module, the get counter upon completion of each get operation; anddetermining, by the origin application messaging module, whether the data transfers have completed further comprises determining whether a value of the get counter is zero. 12. The computer program product of claim 11 wherein initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises initiating the closing stage for the epoch before the data transfers are complete. 13. The computer program product of claim 11 wherein initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises initiating the closing stage for the epoch after the data transfers are completed. 14. The computer program product of claim 11 wherein: each data transfer is effected using a put operation;initiating, by an origin application messaging module on a origin compute node, one or more data transfers to a target compute node for the epoch further comprises incrementing a put counter upon initiation of the put operation for each data transfer;the computer program product further comprises computer program instructions capable of incrementing, by a target application messaging module on the target compute node, a got counter upon completion of each put operation;initiating, by the origin application messaging module after initiating the data transfers, a closing stage for the epoch further comprises sending a value of the put counter to the target compute node;the computer program product further comprises computer program instructions capable of:determining, by the target application messaging module, whether the value of the put counter matches a value of the got counter, andsending, by the target application messaging module to the origin application messaging module, a completion acknowledgement if the value of the put counter matches the value of the got counter; anddetermining, by the origin application messaging module, whether the data transfers have completed further comprises determining whether the completion acknowledgement has been received in the origin compute node. 15. The computer program product of claim 11 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 data communications network, the data communications network optimized for point to point data communications.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (45)
Law Ka Lun,CAX ITX M2K 2Y2, Asynchronous transfer mode switching system.
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.
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.
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.
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.
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.
Daruwalla, Feisal; Forster, James R.; Roeck, Guenter E.; Woundy, Richard M.; Thomas, Michael A., Routing protocol based redundancy design for shared-access networks.
Blandy Geoffrey Owen ; Saba Maher Afif, System and method for instruction burst performance profiling for single-processor and multi-processor systems.
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는 부적절한 답변을 할 수 있습니다.