System, method, and computer program for managing distribution of a finite amount of resources
View Patent ↗A system, method, and computer program product are provided for managing distribution of a finite amount of resources. In use, a quota is received from a first repository, the quota including a portion of a finite amount of resources. Additionally, a plurality of requests is received from a plurality of entities, where each of the plurality of requests is requesting one or more of the resources. Further, the one or more of the resources are conditionally provided to the plurality of entities, in response to the plurality of requests. Further still, it is determined whether a predetermined amount of resources exist. Also, an additional quota is conditionally requested from the first repository, based on the determining.
1. A computer program embodied on a non-transitory computer readable medium, comprising:
computer code for receiving, at each of a plurality of branch repositories, a quota from a central repository, wherein each of the received quotas includes a portion of a finite amount of resources;
computer code for receiving, at one of the branch repositories, a plurality of requests from a plurality of entities, each of the plurality of requests requesting one or more of the resources previously received at the one of the branch repositories;
computer code for conditionally providing, from the one of the branch repositories, the one or more of the resources to the plurality of entities, in response to the plurality of requests;
computer code for determining, by the one of the branch repositories, whether a first predetermined amount of resources exists at the one of the branch repositories;
computer code for conditionally requesting, by the one of the branch repositories, an additional quota from the central repository, based on the determining;
computer code for, in response to determining, at the central repository, that a first amount of resources remaining at the central repository is less than a second predetermined amount of resources, splitting, by the central repository, the first amount of resources remaining at the central repository into a plurality of second portions of resources; and
computer code for receiving, by the one of the branch repositories from the central repository in response to the request for the additional quota, one of the second portions of resources remaining at the central repository, wherein the one of the second portions of resources sent to the one of the branch repositories includes fewer resources than in the additional quota requested by the one of the branch repositories.
2. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the computer program is operable such that the finite amount of resources is associated with a package allocated to the plurality of entities.
3. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the quota includes an account quota associated with an account at the central repository.
4. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the plurality of entities belong to a group.
5. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the plurality of entities share one or more attributes.
6. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the computer program is operable such that the one or more resources are provided to each entity based on an algorithm.
7. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the one or more resources are provided to each entity on a first in, first out (FIFO) order based on when each request was received.
8. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the computer program is operable such that the determining includes comparing a number of available resources at the one of the branch repositories against a predetermined value.
9. The computer program embodied on the non-transitory computer readable medium of claim 8 , wherein the predetermined value includes a minimum amount of resources that are needed at the one of the branch repositories.
10. The computer program embodied on the non-transitory computer readable medium of claim 8 , wherein the predetermined value includes a predetermined low amount that triggers an additional quota request by the one of the branch repositories.
11. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the computer program is operable such that the additional quota is requested from the central repository by the one of the branch repositories if the first predetermined amount of resources does not exist at the one of the branch repositories.
12. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the computer program is operable such that the additional quota is not requested from the central repository by the one of the branch repositories if the first predetermined amount of resources does exist at the one of the branch repositories.
13. The computer program embodied on the non-transitory computer readable medium of claim 1 , wherein the computer program is operable such that a number of available resources at the one of the branch repositories is adjusted when the one or more resources are provided to the plurality of entities.
14. The computer program embodied on the non-transitory computer readable medium of claim 13 , wherein the computer program is operable such that when the quota is received from the central repository, a number of resources in the quota are added to the number of available resources at the one of the branch repositories.
15. A method, comprising:
receiving, at each of a plurality of branch repositories, a quota from a central repository, wherein each of the received quotas includes a portion of a finite amount of resources;
receiving, at one of the branch repositories, a plurality of requests from a plurality of entities, each of the plurality of requests requesting one or more of the resources previously received at the one of the branch repositories;
conditionally providing, from the one of the branch repositories, the one or more of the resources to the plurality of entities, in response to the plurality of requests;
determining, by the one of the branch repositories, whether a first predetermined amount of resources exists at the one of the branch repositories;
conditionally requesting, by the one of the branch repositories, an additional quota from the central repository, based on the determining;
in response to determining, at the central repository, that a first amount of resources remaining at the central repository is less than a second predetermined amount of resources, splitting, by the central repository, the first amount of resources remaining at the central repository into a plurality of second portions of resources; and
receiving, by the one of the branch repositories from the central repository in response to the request for the additional quota, one of the second portions of resources remaining at the central repository, wherein the one of the second portions of resources sent to the one of the branch repositories includes fewer resources than in the additional quota requested by the one of the branch repositories.
16. The method of claim 15 , wherein the additional quota is not requested from the central repository by the one of the branch repositories if the first predetermined amount of resources does exist at the one of the branch repositories.
17. The method of claim 15 , wherein a number of available resources at the one of the branch repositories is adjusted when the one or more resources are provided to the plurality of entities.
18. The method of claim 17 , wherein when the quota is received from the central repository, a number of resources in the quota are added to the number of available resources at the one of the branch repositories.
19. A system, comprising:
at least one processor for:
receiving, at each of a plurality of branch repositories, a quota from a central repository, wherein each of the received quotas includes a portion of a finite amount of resources;
receiving, at one of the branch repositories, a plurality of requests from a plurality of entities, each of the plurality of requests requesting one or more of the resources previously received at the one of the branch repositories;
conditionally providing, from the one of the branch repositories, the one or more of the resources to the plurality of entities, in response to the plurality of requests;
determining, by the one of the branch repositories, whether a first predetermined amount of resources exists at the one of the branch repositories;
conditionally requesting, by the one of the branch repositories, an additional quota from the central repository, based on the determining;
in response to determining, at the central repository, that a first amount of resources remaining at the central repository is less than a second predetermined amount of resources, splitting, by the central repository, the first amount of resources remaining at the central repository into a plurality of second portions of resources; and
receiving, by the one of the branch repositories from the central repository in response to the request for the additional quota, one of the second portions of resources remaining at the central repository, wherein the one of the second portions of resources sent to the one of the branch repositories includes fewer resources than in the additional quota requested by the one of the branch repositories.
20. The system of claim 19 , wherein the at least one processor is coupled to memory via a bus.