Breadth-First Resource Allocation System and Methods

• US 20170078372A1
• Filed: 11/22/2016
• Published: 03/16/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: Choy, Jason K.S., Gao, Minlin, Syomichev, Alexey V., Bell, Aaron, Yang, Libin
• Granted Patent: US 9,882,973 B2
• Time in Patent Office: Days
• 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-16. -16. (canceled)

17. A computer-implemented method that manages allocation of computer resources, the 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 from an application to allocate CPU slots, said request associated with multiple instances of the application;

assigning an identifier to the request, wherein all requests associated with the application receive the same identifier;

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

evenly scheduling distribution of the instances of the application on the at least two servers in the resource group;

releasing the CPU slots in accordance with the evenly scheduled distribution.

18. The method of claim 17, further comprising determining a value representative of the number of running instances of the application on each server in the resource group.

19. The method of claim 18, further comprising determining a value representative of the free memory on each server in the resource group.

20. The method of claim 19, further comprising sorting servers in the resource group in an order, excluding servers with no free memory, by the amount of free memory of the servers.

21. The method of claim 20, further comprising allocating one CPU slot at a time from the list of eligible servers sorted in an order in a round-robin fashion.

22. The method of claim 17, further comprising identifying one or more parameters of the application, wherein the one or more parameters are used in sorting the servers.

23. The method of claim 22, 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.

24. The method of claim 22, 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.

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

26. The method of claim 25, wherein rebalancing CPU slots between servers in the resource group increases the number of available servers with idle CPU slots.

27. 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;

receiving a request from an application to allocate CPU slots, said request associated with multiple instances of the application;

assigning an identifier to the request, wherein all requests associated with the application receive the same identifier;

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

evenly scheduling distribution of the instances of the application on the at least two servers in the resource group;

releasing the CPU slots in accordance with the evenly scheduled distribution.

28. The system of claim 27, further comprising determining a value representative of the number of running instances of the application on each server in the resource group.

29. The system of claim 28, further comprising determining a value representative of the free memory on each server in the resource group.

30. The system of claim 29, further comprising sorting servers in the resource group in an order, excluding servers with no free memory, by the amount of free memory of the servers.

31. The system of claim 30, further comprising allocating one CPU slot at a time from the list of eligible servers sorted in an order in a round-robin fashion.

32. The system of claim 27, further comprising identifying one or more parameters of the application, wherein the one or more parameters are used in sorting the servers.

33. The system of claim 32, 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.

34. The system of claim 33, 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.

35. The system of claim 27, further comprising determining whether rebalancing of CPU slots between servers in the resource group is required to satisfy a parameter of the application.

36. The system of claim 35, wherein rebalancing CPU slots between servers in the resource group increases the number of available servers with idle CPU slots.

37. 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;

receiving a request from an application to allocate CPU slots, said request associated with multiple instances of the application;

assigning an identifier to the request, wherein all requests associated with the application receive the same identifier;

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

evenly scheduling distribution of the instances of the application on the at least two servers in the resource group;

releasing the CPU slots in accordance with the evenly scheduled distribution.