Breadth-first resource allocation system and methods

• US 9,537,790 B1
• Filed: 06/16/2015
• Issued: 01/03/2017
• Est. Priority Date: 02/22/2013
• Status: Active Grant

• Current Assignee: JP Morgan Chase Bank, N.A. (JP Morgan Chase & Co)
• Original Assignee: JP Morgan Chase Bank, N.A. (JP Morgan Chase & Co)
• Inventors: Gao, Minlin, Syomichev, Alexey V., Bell, Aaron, Yang, Libin, Choy, Jason K. S.
• Primary Examiner(s): Dinh, Khanh
• Application Number:
  US14/740,430
• Time in Patent Office: 567 Days
• Field of Search: 709/203, 709/220, 709/227
• US Class Current: 1/1
• CPC Class Codes: G06F 9/5016 the resource being the memory
• CPC Class Codes: H04L 41/0213 Standardised network management protocols, e.g. simple network management protocol [SNMP]
• CPC Class Codes: H04L 41/0896 Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/821 Prioritising resource allocation or reservation requests
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/1012 based on compliance of requirements or conditions with available server resources
• CPC Class Codes: H04L 67/1017 based on a round robin mechanism
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A computing environment adapted with a resource allocation policy, the resource allocation policy being configured to evenly distribute application instances to as many servers as possible.

Claims

1. A computer-implemented method that manages allocation of computer resources, said method comprising:

storing in at least one non-transitory computer memory, data and instructions pertaining to computer resources in a computer network;

accessing the at least one computer memory by a computer processor to execute instructions stored at said non-transitory computer memory, and to perform steps including;

receiving a request to allocate CPU slots, said request associated with one or more instances of an application;

identifying a resource group comprising at least two servers having idle CPU slots;

determining a value representative of the number of running instances of the application on each server in the resource group;

determining a value representative of the free memory on each server in the resource group;

sorting servers in the resource group in an order, excluding servers with no free memory, by the amount of free memory of the servers; and

allocating one CPU slot at a time from the list of eligible servers sorted in an order in a round-robin fashion.

2. The computer-implemented method of claim 1, further comprising identifying one or more parameters of the application, wherein the one or more parameters are used in sorting the servers.

3. The computer-implemented method of claim 2, wherein a parameter defines a minimum number of servers the application needs to run on, the minimum number of servers being equal to or greater than a value of two.

4. The computer-implemented method of claim 2, wherein a parameter defines a preferred server type, the preferred server type being a server with larger memory capacities, a server with faster CPU speeds or a server with less running instances of another application.

5. The computer-implemented method of claim 2, further comprising determining whether rebalancing of CPU slots between servers in the resource group is required to satisfy a parameter of the application.

6. The computer-implemented method of claim 5, wherein rebalancing CPU slots between servers in the resource group increases the number of available servers with idle CPU slots.

7. The computer-implemented method of claim 1, wherein the order is descending order.

8. The computer-implemented method of claim 1, wherein the order is ascending order.

9. A computer system that manages allocation of computer resources, comprising:

at least one non-transitory storage device storing data and instructions; and

at least one computer processor accessing the data and instructions stored at said non-transitory storage device, and executing instructions that perform steps including;

identifying a resource group comprising at least two servers having idle CPU slots;

determining a value representative of the number of running instances of the application on each server in the resource group;

determining a value representative of the free memory on each server in the resource group;

sorting servers in the resource group in an order, excluding servers with no free memory, by the amount of free memory of the servers; and

allocating one CPU slot at a time from the list of eligible servers sorted in an order in a round-robin fashion.

10. The computer-implemented method of claim 9, further comprising identifying one or more parameters of the application, wherein the one or more parameters are used in sorting the servers.

11. The computer-implemented method of claim 10, wherein a parameter defines a minimum number of servers the application needs to run on, the minimum number of servers being equal to or greater than a value of two.

12. The computer-implemented method of claim 10, wherein a parameter defines a preferred server type, the preferred server type being a server with larger memory capacities, a server with faster CPU speeds or a server with less running instances of another application.

13. The computer-implemented method of claim 10, further comprising determining whether rebalancing of CPU slots between servers in the resource group is required to satisfy a parameter of the application.

14. The computer-implemented method of claim 13, wherein rebalancing CPU slots between servers in the resource group increases the number of available servers with idle CPU slots.

15. The computer-implemented method of claim 9, wherein the order is descending order.

16. The computer-implemented method of claim 9, wherein the order is ascending order.

17. A non-transitory computer-readable storage medium programmed to include instructions that, when executed by a processing device, cause the processing device to perform a method, said method comprising:

receiving a request to release CPU slots, said request associated with one or more instances of an application;

identifying a resource group comprising at least two servers having idle CPU slots;

determining a value representative of the number of running instances of the application on each server in the resource group;

determining a value representative of the free memory on each server in the resource group;

sorting servers in the resource group in an order, excluding servers with no free memory, by the amount of free memory of the servers; and

allocating one CPU slot at a time from the list of eligible servers sorted in an order in a round-robin fashion.

18. A computer system that manages allocation of computer resources, comprising:

at least one non-transitory storage device storing data and instructions; and

at least one computer processor accessing the data and instructions stored at said non-transitory storage device, and executing instructions that perform steps including;

identifying a resource group comprising at least two servers having idle CPU slots;

determining a value representative of the number of running instances of the application on each server in the resource group;

determining a value representative of the CPU speed of each server in the resource group;

sorting servers in the resource group in an order, excluding servers with CPU speed less than a threshold, by the CPU speed of the servers; and

allocating one CPU slot at a time from the list of eligible servers sorted in an order in a round-robin fashion.

19. The computer-implemented method of claim 18, further comprising identifying one or more parameters of the application, wherein the one or more parameters are used in sorting the servers.

20. The computer-implemented method of claim 19, wherein a parameter defines a minimum number of servers the application needs to run on, the minimum number of servers being equal to or greater than a value of two.

21. The computer-implemented method of claim 19, wherein a parameter defines a preferred server type, the preferred server type being a server with larger memory capacities, a server with faster CPU speeds or a server with less running instances of another application.

22. The computer-implemented method of claim 19, further comprising determining whether rebalancing of CPU slots between servers in the resource group is required to satisfy a parameter of the application.

23. The computer-implemented method of claim 22, wherein rebalancing CPU slots between servers in the resource group increases the number of available servers with idle CPU slots.

24. The computer-implemented method of claim 18, wherein the order is descending order.

25. The computer-implemented method of claim 18, wherein the order is ascending order.