IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0985075
(2011-01-05)
|
등록번호 |
US-8565120
(2013-10-22)
|
발명자
/ 주소 |
- Acher, Charles J.
- Carey, James E.
- Markland, Matthew W.
- Sanders, Philip J.
|
출원인 / 주소 |
- International Business Machines Corporation
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
5 인용 특허 :
35 |
초록
▼
Topology mapping in a distributed processing system that includes a plurality of compute nodes, including: initiating a message passing operation; including in a message generated by the message passing operation, topological information for the sending task; mapping the topological information for
Topology mapping in a distributed processing system that includes a plurality of compute nodes, including: initiating a message passing operation; including in a message generated by the message passing operation, topological information for the sending task; mapping the topological information for the sending task; determining whether the sending task and the receiving task reside on the same topological unit; if the sending task and the receiving task reside on the same topological unit, using an optimal local network pattern for subsequent message passing operations between the sending task and the receiving task; otherwise, using a data communications network between the topological unit of the sending task and the topological unit of the receiving task for subsequent message passing operations between the sending task and the receiving task.
대표청구항
▼
1. A method of topology mapping in a distributed processing system, the distributed processing system including a plurality of compute nodes, each compute node having a plurality of tasks, the method comprising: initiating, by a sending task, a message passing operation that is unrelated to topology
1. A method of topology mapping in a distributed processing system, the distributed processing system including a plurality of compute nodes, each compute node having a plurality of tasks, the method comprising: initiating, by a sending task, a message passing operation that is unrelated to topology mapping with a receiving task;including, by the sending task, in a message generated by the message passing operation topological information for the sending task;mapping, by the receiving task, the topological information for the sending;determining whether the sending task and the receiving task reside on the same topological unit, wherein a topological unit is a plurality of compute nodes that share a direct data communications connection; wherein the sending task and the receiving task are on different compute nodes;if the sending task and the receiving task reside on the same topological unit, using an optimal local network pattern for subsequent message passing operations between the sending task and the receiving task; andif the sending task and the receiving task do not reside on the same topological unit, using a data communications network between the topological unit of the sending task and the topological unit of the receiving task for subsequent message passing operations between the sending task and the receiving task. 2. The method of claim 1 further comprising including, by the sending task, in the message generated by the message passing operation, topological unit configuration parameters for the topological unit upon which the sending task resides. 3. The method of claim 1 wherein the message passing operation generates a point-to-point message. 4. The method of claim 1 wherein the message passing operation is a collective operation and initiating, by a sending task, a message passing operation that is unrelated to topology mapping with a receiving task further comprises initiating, by each task, a collective operation unrelated to topology mapping. 5. The method of claim 1 wherein including, by the sending task, in a message generated by the message passing operation topological information for the sending task occurs only when the receiving task does not have possession of topological information for the sending task. 6. The method of claim 1 wherein the optimal local network pattern is shared memory. 7. An apparatus for topology mapping in a distributed processing system, 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 that, when executed by the computer processor, cause the apparatus to carry out the steps of: initiating, by a sending task, a message passing operation that is unrelated to topology mapping with a receiving task;including, by the sending task, in a message generated by the message passing operation topological information for the sending task;mapping, by the receiving task, the topological information for the sending task;determining whether the sending task and the receiving task reside on the same topological unit, wherein a topological unit is a plurality of compute nodes that share a direct data communications connection; wherein the sending task and the receiving task are on different compute nodes;if the sending task and the receiving task reside on the same topological unit, using an optimal local network pattern for subsequent message passing operations between the sending task and the receiving task; andif the sending task and the receiving task do not reside on the same topological unit, using a data communications network between the topological unit of the sending task and the topological unit of the receiving task for subsequent message passing operations between the sending task and the receiving task. 8. The apparatus of claim 7 further comprising computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the step of including, by the sending task, in the message generated by the message passing operation, topological unit configuration parameters for the topological unit upon which the sending task resides. 9. The apparatus of claim 7 wherein the message passing operation generates a point-to-point message. 10. The apparatus of claim 7 wherein the message passing operation is a collective operation and initiating, by a sending task, a message passing operation that is unrelated to topology mapping with a receiving task further comprises initiating, by each task, a collective operation unrelated to topology mapping. 11. The apparatus of claim 7 wherein including, by the sending task, in a message generated by the message passing operation topological information for the sending task occurs only when the receiving task does not have possession of topological information for the sending task. 12. The apparatus of claim 7 wherein the optimal local network pattern is shared memory. 13. A computer program product for topology mapping in a distributed processing system, the computer program product disposed upon a non-transitory computer readable storage medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of: initiating, by a sending task, a message passing operation that is unrelated to topology mapping with a receiving task;including, by the sending task, in a message generated by the message passing operation topological information for the sending task;mapping, by the receiving task, the topological information for the sending task;determining whether the sending task and the receiving task reside on the same topological unit, wherein a topological unit is a plurality of compute nodes that share a direct data communications connection; wherein the sending task and the receiving task are on different compute nodes;if the sending task and the receiving task reside on the same topological unit, using an optimal local network pattern for subsequent message passing operations between the sending task and the receiving task; andif the sending task and the receiving task do not reside on the same topological unit, using a data communications network between the topological unit of the sending task and the topological unit of the receiving task for subsequent message passing operations between the sending task and the receiving task. 14. The computer program product of claim 13 further comprising computer program instructions that, when executed, cause a computer to carry out the step of including, by the sending task, in the message generated by the message passing operation, topological unit configuration parameters for the topological unit upon which the sending task resides. 15. The computer program product of claim 13 wherein the message passing operation generates a point-to-point message. 16. The computer program product of claim 13 wherein the message passing operation is a collective operation and initiating, by a sending task, a message passing operation that is unrelated to topology mapping with a receiving task further comprises initiating, by each task, a collective operation unrelated to topology mapping. 17. The computer program product of claim 13 wherein including, by the sending task, in a message generated by the message passing operation topological information for the sending task occurs only when the receiving task does not have possession of topological information for the sending task. 18. The computer program product of claim 13 wherein the optimal local network pattern is shared memory.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.