Send-side matching of data communications messages
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-013/00
G06F-015/16
G06F-015/173
G06F-009/54
G06F-009/46
출원번호
US-0881863
(2010-09-14)
등록번호
US-8776081
(2014-07-08)
발명자
/ 주소
Archer, Charles J.
Blocksome, Michael A.
Ratterman, Joseph D.
Smith, Brian E.
출원인 / 주소
International Business Machines Corporation
대리인 / 주소
Biggers Kennedy Lenart Spraggins LLP
인용정보
피인용 횟수 :
0인용 특허 :
90
초록▼
Send-side matching of data communications messages includes a plurality of compute nodes organized for collective operations, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message inclu
Send-side matching of data communications messages includes a plurality of compute nodes organized for collective operations, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.
대표청구항▼
1. Apparatus for send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes organized for collective operations, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the compu
1. Apparatus for send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes organized for collective operations, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions capable, when executed by the computer processor, of causing the apparatus to carry out the steps of: issuing, by a receiving node to a plurality of source nodes, a receive message that specifies receipt of a single message to be sent from any source node, the receive message also including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer;matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes by comparing the tags of each pending send messages with the message matching information in the receive message;operating by one of the source nodes having a matching send message the hardware-level mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the hardware-level mutual exclusion device;in response to identifying to the receiving node the source node operating the hardware-level mutual exclusion device, issuing, by the receiving node, a cancellation message to the other source nodes that cancels the matching send messages; andsending to the receiving node from the source node operating the hardware-level mutual exclusion device a matched pending send message. 2. The apparatus of claim 1 wherein issuing a receive message further comprises initializing the hardware-level mutual exclusion device to an unlocked state. 3. The apparatus of claim 1 wherein operating the hardware-level mutual exclusion device further comprises operating through data communications network hardware a hardware Read-Modify-Write (‘RMW’) mechanism on the receiving node to atomically obtain a lock on a first predefined memory location and write an identifier of the source node into a second predefined memory location on the receiving node. 4. The apparatus of claim 1 wherein operating the hardware-level mutual exclusion device further comprises operating through data communications network hardware a hardware Test-And-Set (‘T&S’) mechanism on the receiving node to atomically obtain a lock on a predefined memory location and write an identifier of the source node into the predefined memory location on the receiving node. 5. The apparatus of claim 1 wherein operating the hardware-level mutual exclusion device further comprises operating through data communications network hardware a hardware Fetch-And-Increment (‘F&I’) mechanism on the receiving node to atomically obtain a lock on a predefined memory location and write an identifier of the source node into the predefined memory location on the receiving node. 6. A computer program product for send-side matching of communications messages in a distributed computing system comprising a plurality of compute nodes organized for collective operations, the computer program product disposed upon a non-transitory computer readable storage medium, the computer program product comprising computer program instructions capable, when executed, of causing a computer to carry out the steps of: issuing, by a receiving node to a plurality of source nodes, a receive message that specifies receipt of a single message to be sent from any source node, the receive message also including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer;matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes by comparing the tags of each pending send messages with the message matching information in the receive message;operating by one of the source nodes having a matching send message the hardware-level mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the hardware-level mutual exclusion device;in response to identifying to the receiving node the source node operating the hardware-level mutual exclusion device, issuing, by the receiving node, a cancellation message to the other source nodes that cancels the matching send messages; andsending to the receiving node from the source node operating the hardware-level mutual exclusion device a matched pending send message. 7. The computer program product of claim 6 wherein issuing a receive message further comprises initializing the hardware-level mutual exclusion device to an unlocked state. 8. The computer program product of claim 6 wherein operating the hardware-level mutual exclusion device further comprises operating through data communications network hardware a hardware Read-Modify-Write (‘RMW’) mechanism on the receiving node to atomically obtain a lock on a first predefined memory location and write an identifier of the source node into a second predefined memory location on the receiving node. 9. The computer program product of claim 6 wherein operating the hardware-level mutual exclusion device further comprises operating through data communications network hardware a hardware Test-And-Set (‘T&S’) mechanism on the receiving node to atomically obtain a lock on a predefined memory location and write an identifier of the source node into the predefined memory location on the receiving node. 10. The computer program product of claim 6 wherein operating the hardware-level mutual exclusion device further comprises operating through data communications network hardware a hardware Fetch-And-Increment (‘F&I’) mechanism on the receiving node to atomically obtain a lock on a predefined memory location and write an identifier of the source node into the predefined memory location on the receiving node.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (90)
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.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.