1 21152286.

CLAIMS

1. A container moving program that when the program is executed by a computer,

causes the computer to execute a process, the process comprising:
5 acquiring topology information that indicates a calling relationship between a
plurality of containers that operates in a first information processing device, the calling
relationship is represented as an edge in the topology information;
identifying a second container, wherein the second container is called by a first
container and wherein the second container calls two or more containers, and a third
10 container that does not call another container based on the topology information;
extracting a plurality of moving candidate container groups from among the
plurality of containers connected by the continuous calling relationship on the basis of
the topology information;
excluding, from the moving candidates, a first container group that has the largest
15 number of edges among the plurality of moving candidate container groups and a
second container group that includes at least one container included in the first
container group;
selecting the container group that has fewest edges as a moving target from
among the plurality of moving candidate container groups; and
20 moving, to a second information processing device, the container group that is
connected by a calling relationship from the second container to the third container.

2. The container moving program according to claim 1, wherein the process

comprising:
25 identifying the third container on the basis of the topology information, and
identifying the first container and the second container by tracing a caller, starting
from the third container.

3. The container moving program according to claim 1, wherein the process

30 comprising:
when moving destination candidates of the container group are two or more,
identify one of the second information processing device from a plurality of second
information processing devices,
 2 21152286.7

moving, to the one of the second information processing device, a plurality of

container groups that has the first container in common.

4. A container moving program that when the program is executed by a computer,

5 causes the computer to execute a process, the process comprising:
acquiring topology information that indicates a calling relationship between a
plurality of containers that operates in a first information processing device, the calling
relationship is represented as an edge in the topology information;
identifying a second container, wherein the second container is called by a first
10 container and wherein the second container calls two or more containers, and a third
container that does not call another container based on the topology information;
extracting the plurality of moving candidate container groups from the plurality of
containers connected by the continuous calling relationship on the basis of the topology
information;
15 setting moving priorities of a first container group that has the largest number of
edges and a second container group that includes at least one container included in the
first container group among the plurality of moving candidate container groups to be
lower than that of a third container group that does not include the container included
in the first container group;
20 selecting the container group that has fewest edges as a moving target from
among the plurality of moving candidate container groups; and
moving, to a second information processing device, the container group that is
connected by a calling relationship from the second container to the third container.

25 5. A container moving method performed by a computer, comprising: acquiring

topology information that indicates a calling relationship between a plurality of
containers that operates in a first information processing device, the calling relationship
is represented as an edge in the topology information;
identifying a second container, wherein the second container is called by a first
30 container and wherein the second container calls two or more containers, and a third
container that does not call another container based on the topology information;
 3 21152286.7

extracting a plurality of moving candidate container groups from among the

plurality of containers connected by the continuous calling relationship on the basis of
the topology information.
excluding, from the moving candidates, a first container group that has the largest
5 number of edges among the plurality of moving candidate container groups and a
second container group that includes at least one container included in the first
container group;
selecting the container group that has fewest edges as a moving target from among the
plurality of moving candidate container groups; and
10 moving, to a second information processing device, the container group that is
connected by a calling relationship from the second container to the third container.

6. The container moving method according to claim 5, wherein the container moving
method further comprising:
15 identifying the third container on the basis of the topology information, and
identifying the first container and the second container by tracing a caller, starting
from the third container.

7. The container moving method according to claim 5, wherein the container moving
20 method further comprising:
when moving destination candidates of the container group are two or more,
identify one of the second information processing device from a plurality of second
information processing devices,
moving, to the one of the second information processing device, a plurality of
25 container groups that has the first container in common.

8. The container moving method according to claim 7, wherein the container moving
method further comprising
in a case where a plurality of the second information processing devices that is a
30 moving destination candidate of the container group exists, selecting, as the moving
destination, the second information processing device that has fewer relay devices that
exists in a communication path to the first information processing device.
 4 21152286.7

9. A container moving method performed by a computer, comprising:

acquiring topology information that indicates a calling relationship between a
plurality of containers that operates in a first information processing device, the calling
relationship is represented as an edge in the topology information;
5 identifying a second container, wherein the second container is called by a the
first container and wherein the second container calls two or more containers, and a
third container that does not call another container based on the topology information;
extracting the plurality of moving candidate container groups from the plurality of
containers connected by the continuous calling relationship on the basis of the topology
10 information;
setting moving priorities of a first container group that has the largest number of
edges and a second container group that includes at least one container included in the
first container group among the plurality of moving candidate container groups to be
lower than that of a third container group that does not include the container included
15 in the first container group;
selecting the container group that has fewest edges as a moving target from
among the plurality of moving candidate container groups; and
moving, to a second information processing device, the container group that is
connected by a calling relationship from the second container to the third container.
20
10. The container moving method according to claim 9, wherein the container moving
method further comprising
deciding the moving priority of each of a plurality of the second container groups
on the basis of the number of containers included in the first container group included in
25 each of the plurality of second container groups.