Dynamic resource allocations method, systems, and program

US9495214B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9495214-B2
Application numberUS-201213443945-A
CountryUS
Kind codeB2
Filing dateApr 11, 2012
Priority dateApr 11, 2011
Publication dateNov 15, 2016
Grant dateNov 15, 2016

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.

A dynamic resource allocation method and system. The method includes the steps of preparing a plurality of instances in different preparation states; receiving a request on a dynamic scheduling condition from the client computer; and launching some of the plurality of instances in the different preparation states in such a combination that the dynamic scheduling condition is satisfied. The method includes computer apparatus for accomplishing the above method. A tangible storage medium includes program steps which, when executed by computer apparatus, causes the computer apparatus to perform the above method.

First claim

Opening claim text (preview).

What is claimed is: 1. A dynamic resource allocation method for a server system having resources including a plurality of computing nodes, the method implemented by the server system performing dynamic allocation of resources in response to a request from a client computer, the method comprising: preparing a plurality of virtual machine instances including at least one virtual machine instance in each of a plurality preparation states, wherein the plurality preparation states comprise a running state, a swap-out state, a need-to-launch state, a need-to-boot state, and a need-to-install state and wherein a number of virtual machine instances is determined according to a formula; receiving a request on a dynamic scheduling condition from the client computer, wherein the request specifies a requested number of virtual machine instances, a requested time period, and a request certainty that the specified number of virtual machines will reach a running state in the requested time period; determining a current certainty that the requested number of virtual machine instances will reach a running state in the requested time period based on the number of instances in each preparation state in the plurality of virtual machine instances; responsive to determining the requested certainty is satisfied based on the current certainty, launching at least two of the plurality of virtual machine instances in a combination of the plurality of preparation states to achieve the dynamic scheduling condition; retaining a reservation table including fields for an ID of the request, an ID provided for each processing unit of the computing nodes, and a corresponding preparation state; in response to reception of a request to use a processing unit from the client computer, determining whether the processing unit is allocatable on the basis of the reservation table; if the processing unit is allocatable, updating the reservation table to reflect the allocation and allocating the processing unit to the request; responsive to adding a virtual machine instance to the plurality of virtual machine instances, performing a resource allocation adjustment; wherein performing the resource adjustment comprises: determining whether each requested certainty of requests in the reservation table is satisfied based on a determined current certainty; responsive to determining a given requested certainty of a given request is not satisfied, allocating a new hardware resource to the plurality of virtual machine instances. 2. The dynamic resource allocation method according to claim 1 , further comprising: in response to the allocation of the processing unit to the request, setting a field for the corresponding preparation state in the reservation table to the corresponding preparation state. 3. A computer readable, non-transitory, storage medium tangibly embodying computer readable program code having computer readable instructions which, when executed, cause a computer to carry out a method for dynamic resource allocation for a server system having resources of a plurality of computing nodes, in response to a request from a client computer, the method comprising preparing a plurality of virtual machine instances including at least one virtual machine instance in each of a plurality preparation states, wherein the plurality preparation states comprise a running state, a swap-out state, a need-to-launch state, a need-to-boot state, and a need-to-install state and wherein a number of virtual machine instances is determined according to a formula; receiving a request on a dynamic scheduling condition from the client computer, wherein the request specifies a requested number of virtual machine instances, a requested time period, and a request certainty that the specified number of virtual machines will reach a running state in the requested time period; determining a current certainty that the requested number of virtual machine instances will reach a running state in the requested time period based on the number of instances in each preparation state in the plurality of virtual machine instances; responsive to determining the requested certainty is satisfied based on the current certainty, launching at least two of the plurality of virtual machine instances in a combination of the plurality of preparation states to achieve the dynamic scheduling condition; retaining a reservation table including fields for an ID of the request, an ID provided for each processing unit of the computing nodes, and a corresponding preparation state; in response to reception of a request to use a processing unit from the client computer, determining whether the processing unit is allocatable on the basis of the reservation table; if the processing unit is allocatable, updating the reservation table to reflect the allocation and allocating the processing unit to the request; responsive to adding a virtual machine instance to the plurality of virtual machine instances, performing a resource allocation adjustment; wherein performing the resource adjustment comprises: determining whether each requested certainty of requests in the reservation table is satisfied based on a determined current certainty; responsive to determining a given requested certainty of a given request is not satisfied, allocating a new hardware resource to the plurality of virtual machine instances. 4. The computer readable storage medium according to claim 3 , further comprising computer readable instructions for causing the computer to perform, in response to the allocation of the processing unit to the request, setting a field for the corresponding preparation state in the reservation table to the corresponding preparation state. 5. A dynamic resource avocation system in a server system having resources including a plurality of computing nodes, the dynamic resousce allocation system comprising: a memory; a processor communicatively coupled to the memory; and a dynamic resource allocation module communicatively coupled to the memory and the processor, wherein the dynamic resource allocation module is configured to perform the steps of a method comprising: preparing a plurality of virtual machine instances including at least one virtual machine instance in each of a plurality preparation states, wherein the plurality preparation states comprise a running state, a swap-out state, a need-to-launch state, a need-to-boot state, and a need-to-install state and wherein a number of virtual machine instances is determined according to a formula; receiving a request on a dynamic scheduling condition from the client computer, wherein the request specifies a requested number of virtual machine instances, a requested time period, and a request certainty that the specified number of virtual machines will reach a running state in the requested time period; determining a current certainty that the requested number of virtual machine instances will reach a running state in the requested time period based on the number of instances in each preparation state in the plurality of virtual machine instances; responsive to determining the requested certainty is satisfied based on the current certainty, launching at least two of the plurality of virtual machine instances in a combination of the plurality of preparation states to achieve the dynamic scheduling condition; retaining a reservation table including fields for an ID of the request, an ID provided for each processing unit of the computing nodes, and a corresponding preparation state; in response to reception of a request to use a processing unit from the client computer, determining whether the processing unit is allocatable on the basis of the reservation table; if the processing unit is allocatable, updating the reservation table to reflect the allocat

Assignees

Inventors

Classifications

  • Reservation · CPC title

  • G06F9/5027Primary

    the resource being a machine, e.g. CPUs, Servers, Terminals · 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 US9495214B2 cover?
A dynamic resource allocation method and system. The method includes the steps of preparing a plurality of instances in different preparation states; receiving a request on a dynamic scheduling condition from the client computer; and launching some of the plurality of instances in the different preparation states in such a combination that the dynamic scheduling condition is satisfied. The meth…
Who is the assignee on this patent?
Tatsubori Michiaki, Ueda Yohei, IBM
What technology area does this patent fall under?
Primary CPC classification G06F9/5027. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Nov 15 2016 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).