Rescheduling of virtual machine migrations with less impact on an existing migration schedule

US11256541B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11256541-B2
Application numberUS-202016773249-A
CountryUS
Kind codeB2
Filing dateJan 27, 2020
Priority dateFeb 8, 2019
Publication dateFeb 22, 2022
Grant dateFeb 22, 2022

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

An apparatus, for an existing schedule indicating time slots during which virtual-machines are to be migrated between physical-machines, acquires change information indicating a change of first time slots during which first virtual-machines are to be migrated, and generates constraint information including a group of constraints regarding the change information and second time slots during which second virtual-machines other than the first virtual-machines are to be migrated. The apparatus generates semi-constraint information items each generated by excluding, from the constraint information, an exclusion target constraint that is selected in turn from among the group of constraints, and generates, for each semi-constraint information item, a rescheduling result by rescheduling migrations of the virtual-machines. The apparatus outputs a first rescheduling result that is one of the generated rescheduling results which reduces a difference between a scheduled migration time indicated by the first rescheduling result and scheduled migration times of the second virtual-machines.

First claim

Opening claim text (preview).

What is claimed is: 1. A non-transitory, computer-readable recording medium having stored therein a program for causing a computer to execute a process comprising: for an existing schedule indicating time slots during which a plurality of virtual machines are desired to be migrated between a plurality of physical machines, acquiring change information indicating a change of first time slots, among the time slots, during which a first group of virtual machines, among the plurality of virtual machines, are to be migrated; generating constraint information including a set of constraints regarding the change information and second time slots, among the time slots, during which a second group of virtual machines other than the first group of virtual machines are to be migrated; generating a plurality of semi-constraint information items, a semi-constraint information item, among the plurality of semi-constraint information items, generated by selecting a group of constraints, among the set of constraints, to be excluded, based on a minimal unsatisfiable (UNSAT) core for a migration time of a virtual machine, among the plurality of virtual machines; generating, the semi-constraint information item, a plurality of respective rescheduling results by rescheduling migrations of the plurality of virtual machines; and selecting a first rescheduling result indicating a first rescheduling, from among the respective rescheduling results, which minimizes a difference between a requested first time slot indicated by the change information and a new first scheduled time slot after the first rescheduling. 2. The non-transitory, computer-readable recording medium of claim 1 , wherein, a constraint included in the minimal UNSAT core is selected to be extracted from the group of constraints as the exclusion target constraint. 3. The non-transitory, computer-readable recording medium of claim 2 , wherein the constraint included in the minimal UNSAT core is selected as the exclusion target constraint, based on a priority of a virtual machine, among respective priorities of the plurality of virtual machines. 4. The non-transitory, computer-readable recording medium of claim 1 , wherein, the, selecting further includes a second rescheduling result indicating a second rescheduling, from among the rescheduling results, which reduces a first difference between a first time slot, among the first time slots indicated by the change information, and a second time slot, among the second time slots of the second virtual machines, or reduces a second difference between a first time slot, among the first time slots indicated by the change information and the new first scheduled time slot indicated by the first rescheduling result. 5. The non-transitory, computer-readable recording medium of claim 4 , wherein, the selecting selects the second rescheduling result that minimizes either one of the first difference or the second difference. 6. The non-transitory, computer-readable recording medium of claim 1 , wherein the change information indicating the change of first time slots includes information indicating a first time slot, among the first time slots, in which a migration of a first virtual machine, among the first virtual machines is allowed or a first time slot, among the first time slots, in which a migration of a first virtual machine, among the first virtual machines, is to be avoided. 7. The non-transitory, computer-readable recording medium of claim 1 , wherein the constraint information includes, respective constraints related to maintenance periods of the plurality of physical machines, wherein during a maintenance period, among the maintenance periods, a maintenance is to be performed on a physical machine, among the plurality of physical machines, respective configurations of the plurality of physical machines and the plurality of virtual machines, and respective turnaround times for a migration of a virtual machine, among the plurality of virtual machines, between the plurality of physical machines. 8. The non-transitory, computer-readable recording medium of claim 7 , wherein, for the first rescheduling result, a time period for performing a maintenance on a physical machine, among the plurality of physical machines is determined, based on maintenance periods indicated by the constraint information, the plurality of semi-constraint information items, and a turnaround time for a maintenance of a physical machine, among the plurality of physical machines. 9. An apparatus comprising: a memory; and a processor coupled to the memory and configured to: for an existing schedule indicating time slots during which a plurality of virtual machines are desired to be migrated between a plurality of physical machines, acquire change information indicating a change of first time slots, among the time slots, during which a first group of virtual machines, among the plurality of virtual machines, are to be migrated; generate constraint information including a set of constraints regarding the change information and second time slots, among the time slots, during which a second group of virtual machines other than the first group of virtual machines are to be migrated; generating a plurality of semi-constraint information items, a semi-constraint information item, among the plurality of semi-constraint information items, generated by selecting a group of constraints, among the set of constraints, to be excluded, based on a minimal unsatisfiable (UNSAT) core for a migration time of a virtual machine, among the plurality of virtual machines; generating, the semi-constraint information item, a plurality of respective rescheduling results by rescheduling migrations of the plurality of virtual machines; and selecting a rescheduling result indicating to a rescheduling, from among the respective rescheduling results, which minimizes a difference between a requested first time slot indicated by the change information and a new scheduled time slot after the rescheduling. 10. A method performed by a computer, the method comprising: for an existing schedule indicating time slots during which a plurality of virtual machines are desired to be migrated between a plurality of physical machines, acquiring change information indicating a change of first time slots, among the time slots, during which a first group of virtual machines, among the plurality of virtual machines, are to be migrated; generating constraint information including a set of constraints regarding the change information and second time slots, among the time slots, during which a second group of virtual machines other than the first group of virtual machines are to be migrated; generating a plurality of semi-constraint information items, a semi-constraint information item, among the plurality of semi-constraint information items, generated by selecting a group of constraints, among the set of constraints, to be excluded, based on a minimal unsatisfiable (UNSAT) core for a migration time of a virtual machine, among the plurality of virtual machines; generating, for the semi-constraint information item, a plurality of respective rescheduling results by rescheduling migrations of the plurality of virtual machines; and selecting a rescheduling result indicating to a rescheduling, from among the respective rescheduling results, which minimizes a difference between a requested first time slot indicated by the change information and a new scheduled time slot after the rescheduling.

Assignees

Inventors

Classifications

  • Hypervisor-specific management and integration aspects · CPC title

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

  • Request control · CPC title

  • G06F9/5077Primary

    Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455) · CPC title

  • Resource constraint · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11256541B2 cover?
An apparatus, for an existing schedule indicating time slots during which virtual-machines are to be migrated between physical-machines, acquires change information indicating a change of first time slots during which first virtual-machines are to be migrated, and generates constraint information including a group of constraints regarding the change information and second time slots during whic…
Who is the assignee on this patent?
Fujitsu Ltd
What technology area does this patent fall under?
Primary CPC classification G06F9/5077. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Feb 22 2022 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).