APPLICATION LEVEL BASED RESOURCE MANAGEMENT IN MULTI-TENANT APPLICATIONS

• US 20140359113A1
• Filed: 11/13/2013
• Published: 12/04/2014
• Est. Priority Date: 05/30/2013
• Status: Abandoned Application

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Krebs, Rouven, Ahmed, Nadia
• Application Number:
  US14/079,289
• Publication Number:
  US 20140359113A1
• Time in Patent Office: Days
• US Class Current: 709/224
• CPC Class Codes: G06F 2209/504 Resource capping
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources
• CPC Class Codes: H04L 41/5009 Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
• CPC Class Codes: H04L 41/5025 by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
• CPC Class Codes: H04L 41/5096 wherein the managed service relates to distributed or central networked applications
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/1012 based on compliance of requirements or conditions with available server resources
• CPC Class Codes: Y02D 10/00 Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A system includes multiple tenant queues, where each of the queues is associated with a single tenant is configured to queue one or more requests from its respective single tenant. One or more processing nodes have one or more shared resources for processing the requests queued in the multiple tenant queues. A first feedback loop is configured to determine a resource demand for each of the tenants. An admission controller is configured to calculate an actual utilization value of a shared resource for each of the tenants using the knowledge of resource demands for each of the tenants request from the first feedback loop and control processing of the requests from each of the tenant queues based on a reference value for each of the tenants and the actual utilization value of a shared resource for each of the tenants, where the reference value represents an allowed utilization for each of the tenants.

Claims

1. A system including instructions recorded on a computer-readable storage device and executable by at least one processor, the system comprising:

multiple tenant queues, wherein each of the queues is associated with a single tenant and each of the queues is configured to queue one or more requests from its respective single tenant;

one or more processing nodes, the processing nodes comprising one or more shared resources for processing the requests queued in the multiple tenant queues;

a first feedback loop that is operably coupled to an output of the processing nodes, wherein the first feedback loop is configured to determine a resource demand for each of the tenants; and

an admission controller that is operably coupled to the tenant queues, the processing nodes and the first feedback loop, wherein the admission controller is configured to;

calculate an actual utilization value of a shared resource for each of the tenants using the resource demand for each request type of the tenants from the first feedback loop, and

control processing of the requests by the processing nodes from each of the tenant queues based on a reference value for each of the tenants received by the admission controller and the actual utilization value of a shared resource for each of the tenants, wherein the reference value represents an allowed utilization for each of the tenants.

2. The system of claim 1 wherein the admission controller is configured to calculate the actual utilization value based on the processed requests from each tenant during a period of time or currently processed by the processing nodes.

3. The system of claim 1 wherein the admission controller is configured to calculate the actual utilization value based on estimated or measured resource demands per request for each tenant based on historical data.

4. The system of claim 1 wherein the admission controller controls the processing of the requests by selecting a next request to process from one of the tenant queues.

5. The system of claim 1 wherein the admission controller is configured to drop one or more requests from a tenant queue that exceed the allowed utilization.

6. The system of claim 1 wherein the first feedback loop comprises a resource demand estimator that is configured to determine the resource demand by estimating demands on each of the processor nodes per request type and per tenant.

7. The system of claim 1 further comprising a monitor that is operably coupled to an output of the processing nodes and to an input of the first feedback loop, wherein the monitor is configured to determine a quality of service for each of the tenant queues.

8. The system of claim 7 further comprising:

a second feedback loop that is operably coupled to the output of the monitor; and

a service level agreement (SLA) controller that is coupled to the second feedback loop, wherein the SLA controller is configured to update the reference value for each of the tenant queues using the quality of service determined by the monitor through the second feedback loop.

9. A computer-implemented method for executing instructions stored on a computer-readable storage device, the method comprising:

receiving one or more requests from multiple tenant queues, wherein each of the queues is associated with a single tenant and each of the queues is configured to queue one or more requests from its respective single tenant;

processing the requests queued in the multiple tenant queues by one or more processing nodes, wherein the processing nodes comprise one or more shared resources;

determining a resource demand for each of the tenants by a first feedback loop that is operably coupled to an output of the processing nodes;

calculating an actual utilization value of a shared resource for each of the tenants by an admission controller using the resource demand for each of the tenants; and

controlling processing of the requests by the processing nodes from each of the tenant queues by the admission controller based on a reference value for each of the tenants received by the admission controller and the actual utilization value of a shared resource for each of the tenants, wherein the reference value represents an allowed utilization for each of the tenants.

10. The computer-implemented method of claim 9 wherein calculating the actual utilization value comprises calculating the actual utilization value based on the processed requests from each tenant during a period of time or currently processed by the processing nodes.

11. The computer-implemented method of claim 9 wherein calculating the actual utilization value comprises calculating the actual utilization value based on estimated or measured resource demands per request for each tenant based on historical data.

12. The computer-implemented method of claim 9 wherein controlling the processing of the requests comprises selecting a next request to process from one of the tenant queues.

13. The computer-implemented method of claim 9 further comprising dropping one or more requests from a tenant queue that exceed the allowed utilization by the admission controller.

14. The computer-implemented method of claim 9 wherein determining the resource demand for each of the tenants comprises estimating demands on each of the processor nodes per request type and per tenant by a resource demand estimator within the first feedback loop.

15. The computer-implemented method of claim 9 further comprising determining a quality of service for each of the tenant queues by a monitor.

16. The computer-implemented method of claim 15 further comprising updating the reference value for each of the tenant queues using the quality of service for each tenant determined by a service level agreement (SLA) controller coupled to the monitor through a second feedback loop.

17. A computer program product, the computer program product being tangibly embodied on a computer-readable storage device and comprising instructions that, when executed, are configured to:

receive one or more requests from multiple tenant queues, wherein each of the queues is associated with a single tenant and each of the queues is configured to queue one or more requests from its respective single tenant;

process the requests queued in the multiple tenant queues by one or more processing nodes, wherein the processing nodes comprise one or more shared resources;

determine a resource demand for each of the tenants by a first feedback loop that is operably coupled to an output of the processing nodes;

calculate an actual utilization value of a shared resource for each of the tenants by an admission controller using the resource demand for each of the tenants; and

control processing of the requests by the processing nodes from each of the tenant queues by the admission controller based on a reference value for each of the tenants received by the admission controller and the actual utilization value of a shared resource for each of the tenants, wherein the reference value represents an allowed utilization for each of the tenants.

18. The computer program product of claim 17 wherein calculating the actual utilization value includes calculating the actual utilization value based on the processed requests from each tenant during a period of time or currently processed by the processing nodes.

19. The computer program product of claim 17 wherein calculating the actual utilization value comprises calculating the actual utilization value based on estimated or measured resource demands per request for each tenant based on historical data.

20. The computer program product of claim 17 wherein controlling the processing of the requests comprises selecting a next request to process from one of the tenant queues.

21. The computer program product of claim 17 further comprising instructions that, when executed, are configured to drop one or more requests from a tenant queue that exceed the allowed utilization by the admission controller.

22. The computer program product of claim 17 wherein determining the resource demand for each of the tenants comprises estimating demands on each of the processor nodes per request type and per tenant by a resource demand estimator within the first feedback loop.

23. The computer program product of claim 17 further comprising instructions that, when executed, are configured to determine a quality of service for each of the tenant queues by a monitor.

24. The computer program product of claim 23 further comprising instructions that, when executed, are configured to update the reference value for each of the tenant queues using the quality of service for each tenant determined by a service level agreement (SLA) controller coupled to the monitor through a second feedback loop.