Information processing apparatus, method and non-transitory computer-readable storage medium
An information processing apparatus is configured to receive a request for communication between a first node and a second node included in a parallel calculation system, acquire job execution information relating a job to be executed by the parallel calculation system, generate connected graph information based on first information on the first node, second information on the second node, the job execution information, and topology information indicating a topology of the plurality of nodes, generate, based on the connected graph information, route information indicating a plurality of routes used when the communication between the first node and the second node is executed, specify, based on the route information, a route having the lowest passing cost among the plurality of routes; and specify a node included in the specified route as a relay node based on positions of the plurality of nodes in the specified route.
1. An information processing apparatus comprising:
a memory; and
a processor coupled to the memory and configured to:
receive, from a first node included in a parallel calculation system including a plurality of nodes, a request for communication between the first node and a second node included in the parallel calculation system;
acquire job execution information relating a job to be executed by the parallel calculation system;
generate connected graph information based on first information on the first node, second information on the second node, the job execution information, and topology information indicating a topology of the plurality of nodes;
generate, based on the connected graph information, route information indicating a plurality of routes used when the communication between the first node and the second node is executed;
specify, based on the route information, a route having the lowest passing cost among the plurality of routes; and
specify a node included in the specified route as a relay node based on positions of the plurality of nodes in the specified route.
2. The information processing apparatus according to claim 1 , wherein the processor is configured to:
specify a plurality of active nodes from the first node, the second node, and a plurality of third nodes included in the plurality of nodes,
generate a plurality of partial graphs including a first partial graph having the plurality of active nodes as vertices interconnected and a second partial graph having a plurality of fourth nodes other than the plurality of active nodes as vertices interconnected, and
generate, based on the topology information, the connected graph information by mutually coupling the plurality of partial graphs.
3. The information processing apparatus according to claim 2 , wherein
the processor is configured to generate, based on the connected graph information, the route information indicating a plurality of routes leading to a partial graph including the second node among the plurality of partial graphs from a partial graph including the first node among the plurality of partial graphs via another partial graph of the plurality of partial graphs.
4. A method comprising:
receiving, from a first node included in a parallel calculation system including a plurality of nodes, a request for communication between the first node and a second node included in the parallel calculation system;
acquiring job execution information relating a job to be executed by the parallel calculation system;
generating connected graph information based on first information on the first node, second information on the second node, the job execution information, and topology information indicating a topology of the plurality of nodes;
generating, based on the connected graph information, route information indicating a plurality of routes used when the communication between the first node and the second node is executed;
specifying, based on the route information, a route having the lowest passing cost among the plurality of routes; and
specifying a node included in the specified route as a relay node based on positions of the plurality of nodes in the specified route.
5. The method according to claim 4 , further comprising:
specifying a plurality of active nodes from the first node, the second node, and a plurality of third nodes included in the plurality of nodes;
generating a plurality of partial graphs including a first partial graph having the plurality of active nodes as vertices interconnected and a second partial graph having a plurality of fourth nodes other than the plurality of active nodes as vertices interconnected; and
generating, based on the topology information, the connected graph information by mutually coupling the plurality of partial graphs.
6. The method according to claim 5 , further comprising:
generating, based on the connected graph information, the route information indicating a plurality of routes leading to a partial graph including the second node among the plurality of partial graphs from a partial graph including the first node among the plurality of partial graphs via another partial graph of the plurality of partial graphs.
7. A non-transitory computer-readable storage medium storing a program that causes an information processing apparatus to execute a process, the process comprising:
receiving, from a first node included in a parallel calculation system including a plurality of nodes, a request for communication between the first node and a second node included in the parallel calculation system;
acquiring job execution information relating a job to be executed by the parallel calculation system;
generating connected graph information based on first information on the first node, second information on the second node, the job execution information, and topology information indicating a topology of the plurality of nodes;
generating, based on the connected graph information, route information indicating a plurality of routes used when the communication between the first node and the second node is executed;
specifying, based on the route information, a route having the lowest passing cost among the plurality of routes; and
specifying a node included in the specified route as a relay node based on positions of the plurality of nodes in the specified route.
8. The non-transitory computer-readable storage medium according to claim 7 , the process further comprising:
specifying a plurality of active nodes from the first node, the second node, and a plurality of third nodes included in the plurality of nodes;
generating a plurality of partial graphs including a first partial graph having the plurality of active nodes as vertices interconnected and a second partial graph having a plurality of fourth nodes other than the plurality of active nodes as vertices interconnected; and
generating, based on the topology information, the connected graph information by mutually coupling the plurality of partial graphs.
9. The non-transitory computer-readable storage medium according to claim 8 , the process further comprising:
generating, based on the connected graph information, the route information indicating a plurality of routes leading to a partial graph including the second node among the plurality of partial graphs from a partial graph including the first node among the plurality of partial graphs via another partial graph of the plurality of partial graphs.