Storage medium and container moving method

Patent metadata

Field	Value
Publication number	US-2021294632-A1
Application number	US-202117160159-A
Country	US
Kind code	A1
Filing date	Jan 27, 2021
Priority date	Mar 23, 2020
Publication date	Sep 23, 2021
Grant date	—

Abstract

A non-transitory computer-readable storage medium storing a program that causes a computer to execute a process, the process includes acquiring topology information that indicates a calling relationship between a plurality of containers that operates in a first information processing device; identifying a second container that is one of calls of a first container that calls two or more containers, and a third container that does not call another container based on the topology information; and moving, to a second information processing device, a container group that is connected by the calling relationship from the second container to the third container.

First claim

What is claimed is:

1 . A non-transitory computer-readable storage medium storing a program that causes a 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; identifying a second container that is one of calls of a first container that calls two or more containers, and a third container that does not call another container based on the topology information; and moving, to a second information processing device, a container group that is connected by the calling relationship from the second container to the third container.

2 . The non-transitory computer-readable storage medium storing a program according to claim 1 , wherein the process comprising:
identifying the third container based on the topology information, and identifying the first container and the second container by tracing a caller from the third container.

3 . The non-transitory computer-readable storage medium storing a program according to claim 1 , wherein the process 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 container groups that has the first container in common.

4 . The non-transitory computer-readable storage medium storing a program according to claim 1 , wherein
the calling relationship between the containers is represented as an edge in the topology information, and the process comprising:
extracting a plurality of moving candidate container groups based on the topology information, and
selecting the container group that has fewer edges as a moving target from among the plurality of moving candidate container groups.

5 . The non-transitory computer-readable storage medium storing a program according to claim 4 , wherein the process comprising:
extracting the plurality of moving candidate container groups from among the plurality of containers connected by the continuous calling relationship based on the topology information, and excluding, from the moving candidates, a first container group that has the largest 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.

6 . The non-transitory computer-readable storage medium storing a program according to claim 4 , wherein the process comprising:
extracting the plurality of moving candidate container groups from the plurality of containers connected by the continuous calling relationship based on the topology information, and 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.

7 . 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; identifying a second container that is one of calls of a first container that calls two or more containers, and a third container that does not call another container based on the topology information; and moving, to a second information processing device, a container group that is connected by the calling relationship from the second container to the third container.

8 . The container moving method according to claim 7 , wherein the container moving method further comprising:
identifying the third container based on the topology information, and identifying the first container and the second container by tracing a caller from the third container.

9 . The container moving method according to claim 7 , wherein the container moving 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 container groups that has the first container in common.

10 . The container moving method according to claim 7 , wherein
the calling relationship between the containers is represented as an edge in the topology information, and the container moving method further comprising:
extracting a plurality of moving candidate container groups based on the topology information, and
selecting the container group that has fewer edges as a moving target from among the plurality of moving candidate container groups.

11 . The container moving method according to claim 10 , the container moving method further comprising:
extracting the plurality of moving candidate container groups from among the plurality of containers connected by the continuous calling relationship based on the topology information, and excluding, from the moving candidates, a first container group that has the largest 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.

12 . The container moving method according to claim 10 , wherein the container moving method further comprising:
extracting the plurality of moving candidate container groups from the plurality of containers connected by the continuous calling relationship based on the topology information, and 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.

13 . The container moving method according to claim 12 , wherein the container moving method further comprising
deciding the moving priority of each of a plurality of the second container groups based on the number of containers included in the first container group included in each of the plurality of second container groups.

14 . 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 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.

Assignees

• Fujitsu Ltd

Inventors

• Kondo Reiko
• Watanabe Yukihiro

Classifications

• G06F9/5066

  Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451) · CPC title

• G06F2009/4557

  Distribution of virtual machine instances; Migration and load balancing · CPC title

• G06F9/4856

  resumption being on a different machine, e.g. task migration, virtual machine migration (G06F9/5088 takes precedence) · CPC title

• G06F9/45558 Primary

  Hypervisor-specific management and integration aspects · CPC title

• G06F2009/45595

  Network integration; Enabling network access in virtual machine instances · CPC title