Dynamic resource allocation method, system, and program
Abstract
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.
Claims
exact text as granted — not AI-modified1 . A dynamic resource allocation system in a server system having resources including a plurality of computing nodes, the dynamic resource allocation system configured to dynamically allocate resources in response to a request from a client computer by the processing of the server system, the dynamic resource allocation system comprising:
a module for preparing a plurality of instances in different preparation states; a module for receiving a request on a dynamic scheduling condition from the client computer; and a module for launching at least two of the plurality of instances in the different preparation states to achieve the dynamic scheduling condition.
2 . The dynamic resource allocation system according to claim 1 , further comprising:
a reservation table stored in storage means of the server system including fields for an ID of the request, an ID provided for each of CPUs of the computing nodes, and a step of the preparation state; and means, responsive to reception of a request from the client computer to use a computing node, for determining whether each of the computing nodes is allocatable on the basis of the reservation table; and allocation means for updating the reservation table, in response to a determination that a computing node is allocatable, to reflect the allocation and allocating the computing node to the request.
3 . The dynamic resource allocation system according to claim 2 , wherein
the request includes a certainty on whether the dynamic scheduling condition is to be satisfied, the means for allocating the computing node to the request includes means for determining whether the certainty is satisfied, and the allocation means includes means for allocating the computing node to the request only when the certainty is satisfied.
4 . The dynamic resource allocation system according to claim 3 , wherein the means for determining whether the certainty is satisfied is based on a statistical value of a frequency of receiving the request to use the computing node.
5 . The dynamic resource allocation system according to claim 1 , wherein the preparation state includes a running state, a swap-out state, a need-to-launch state, a need-to-boot state, and a need-to-install state.Join the waitlist — get patent alerts
Track US2012331152A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.