METHOD AND APPARATUS FOR PROVIDING ALLOCATING RESOURCES
Various embodiments provide a method and apparatus for allocating resources to processes by using statistical allocation based on the determined maximum average resource demand at any time across all applications (“ μ ”), and the determined maximum resource demand at any time by any application (“C”). In particular, resource allocation includes an auto-scaling scheme based on μ and C.
1 . An apparatus for providing resource allocation, the apparatus comprising:
a data storage; and
a processor communicatively connected to the data storage, the processor being configured to:
determine a worst case average requirement;
determine a maximum resource requirement; and
determine a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement.
2 . The apparatus of claim 1 , wherein the processor is further configured to:
determine a number of allocation steps;
wherein the set of allocation steps includes the determined number of allocation steps.
3 . The apparatus of claim 1 , wherein the processor is further configured to:
collect a set of historical data;
wherein the worst case average requirement and the maximum resource requirement are based on at least a portion of the set of historical data.
4 . The apparatus of claim 3 , wherein the processor is further configured to:
trigger determination of the resource allocation scheme based on a trigger event.
5 . The apparatus of claim 4 , wherein the trigger event is based on resource utilization.
6 . The apparatus of claim 1 , wherein the worst case average requirement=max t μ(t); where μ(t) is the average amount of resources requested by an application at time t.
7 . The apparatus of claim 6 , wherein the maximum resource requirement=max i,t h i (t); where h i (t) is the historical resource requirement for each application I at time t.
8 . The apparatus of claim 1 , wherein the resource allocation scheme is based on a Markov inequality.
9 . The apparatus of claim 8 , wherein the Markov inequality includes an objective to minimize an expected amount of resource allocation.
10 . The apparatus of claim 1 , wherein the resource allocation scheme is based on an adversarial approach.
11 . The apparatus of claim 10 , wherein the adversarial approach includes an adversary's objective to pick a density distribution that maximizes the expected amount of resources allocated to an application.
12 . A method for providing resource allocation, the method comprising:
at a processor communicatively connected to a data storage, determining a worst case average requirement;
determining, by the processor in cooperation with the data storage, a maximum resource requirement; and
determining, by the processor in cooperation with the data storage, a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement.
13 . The method of claim 12 , wherein the method further comprises:
determining, by the processor in cooperation with the data storage, a number of allocation steps;
wherein the set of allocation steps includes the determined number of allocation steps.
14 . The method of claim 12 , wherein the method further comprises:
collecting, by the processor in cooperation with the data storage, a set of historical data;
wherein the worst case average requirement and the maximum resource requirement are based on at least a portion of the set of historical data.
15 . The method of claim 14 , wherein the method further comprises:
triggering, by the processor in cooperation with the data storage, determination of the resource allocation scheme based on a trigger event.
16 . The method of claim 15 , wherein the trigger event is based on resource utilization.
17 . The method of claim 12 , wherein the worst case average requirement=max t μ(t); where μ(t) is the average amount of resources requested by an application at time t.
18 . The method of claim 12 , wherein the maximum resource requirement=max i,t h i (t); where h i (t) is the historical resource requirement for each application i at time t.
19 . The method of claim 12 , wherein the resource allocation scheme is based on a Markov inequality.
20 . The method of claim 12 , wherein the resource allocation scheme is based on an adversarial approach.
21 . A non-transitory computer-readable storage medium storing instructions which, when executed by a computer, cause the computer to perform a method, the method comprising:
determining a worst case average requirement;
determining a maximum resource requirement; and
determining a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement.