Dynamic instantiation and management of virtual caching appliances

Patent metadata

Field	Value
Publication number	US-11263057-B2
Application number	US-202016835375-A
Country	US
Kind code	B2
Filing date	Mar 31, 2020
Priority date	Dec 22, 2011
Publication date	Mar 1, 2022
Grant date	Mar 1, 2022

Abstract

It is detected that a metric associated with a first workload has breached a first threshold. It is determined that the first workload and a second workload access the same storage resources, wherein the storage resources are associated with a storage server. It is determined that the metric is impacted by the first workload and the second workload accessing the same storage resources. A candidate solution is identifier. An estimated impact of a residual workload is determined based, at least in part, on the candidate solution. A level of caching of at least one of the first workload or the second workload is adjusted based, at least in part, on the estimated impact of the residual workload.

First claim

What is claimed is:

1. A method comprising:
detecting that a metric associated with a first workload has violated a threshold;
identifying a set of candidate solutions to address the violation, wherein the set of candidate solutions represent different cache sizes corresponding to predefined ratios of an overall working set size;
determining estimated impacts of implementing the set of candidate solutions, wherein historical working set size estimates obtained from a storage system are utilized to generate miss-ratio information used to determine the estimated impacts of implementing candidate solutions;
selecting a candidate solution based upon an estimated impact of the candidate solution; and
implementing the candidate solution to dynamically adjust resource allocation for resolving the violation.

2. The method of claim 1 , wherein the miss-ratio information corresponds to a fraction of I/Os sent to the storage system for various cache sizes corresponding to the historical working set size estimates.

3. The method of claim 2 , wherein the fraction of I/Os correspond to cache misses for the various cache sizes.

4. The method of claim 1 , comprising:
selecting the candidate solution based upon the estimate impact of the candidate solution being less than an estimated impact of one or more other candidate solutions within the set of candidate solutions.

5. The method of claim 1 , wherein the candidate solution comprises adjusting a level of caching provided for the first workload.

6. The method of claim 1 , wherein the candidate solution comprises adjusting a level of caching provided for a second workload that accesses a same resource as the workload.

7. The method of claim 1 , wherein the candidate solution comprises routing the first workload through a virtual cache appliance.

8. The method of claim 1 , wherein the candidate solution comprises increases a size of a virtual cache appliance through which the first workload is routed.

9. The method of claim 1 , wherein the candidate solution comprises creating a new virtual cache appliance through which to route the first workload.

10. A non-transitory machine readable medium comprising instructions for performing a method, which when executed by a machine, causes the machine to:
detect that a metric associated with a first workload has violated a threshold;
identify a set of candidate solutions to address the violation, wherein the set of candidate solutions represent different cache sizes corresponding to predefined ratios of an overall working set size;
determine estimated impacts of implementing the set of candidate solutions, wherein historical working set size estimates obtained from a storage system are utilized to generate miss-ratio information used to determine the estimated impacts of implementing candidate solutions;
select a candidate solution based upon an estimated impact of the candidate solution; and
implement the candidate solution to dynamically adjust resource allocation for resolving the violation.

11. The non-transitory machine readable medium of claim 10 , wherein the instructions cause the machine to:
determine the estimated impact upon a residual workload based upon implementing the candidate solution.

12. The non-transitory machine readable medium of claim 10 , wherein the instructions cause the machine to:
determine the estimated impact upon a storage resource accessed by the first workload based upon implementing the candidate solution.

13. The non-transitory machine readable medium of claim 10 , wherein the instructions cause the machine to:
select the candidate solution based upon the estimate impact of the candidate solution being less than an estimated impact of one or more other candidate solutions within the set of candidate solutions.

14. The non-transitory machine readable medium of claim 10 , wherein the candidate solution comprises adjusting a level of caching provided for the first workload.

15. The non-transitory machine readable medium of claim 10 , wherein the candidate solution comprises adjusting a level of caching provided for a second workload that accesses a same resource as the workload.

16. The non-transitory machine readable medium of claim 10 , wherein the candidate solution comprises routing the first workload through a virtual cache appliance.

17. The non-transitory machine readable medium of claim 10 , wherein the candidate solution comprises increases a size of a virtual cache appliance through which the first workload is routed.

18. The non-transitory machine readable medium of claim 10 , wherein the candidate solution comprises creating a new virtual cache appliance through which to route the first workload.

19. A computing device comprising:
a memory comprising machine executable code for performing a method; and
a processor coupled to the memory, the processor configured to execute the machine executable code to cause the processor to:
detect that a metric associated with a first workload has violated a threshold;
identify a set of candidate solutions to address the violation, wherein the set of candidate solutions represent different cache sizes corresponding to predefined ratios of an overall working set size;
determine estimated impacts of implementing the set of candidate solutions, wherein historical working set size estimates obtained from a storage system are utilized to generate miss-ratio information used to determine the estimated impacts of implementing candidate solutions;
select a candidate solution based upon an estimated impact of the candidate solution; and
implement the candidate solution to dynamically adjust resource allocation for resolving the violation.

20. The computing device of claim 19 , wherein the candidate solution comprises increases a size of a virtual cache appliance through which the first workload is routed.

Assignees

• Netapp Inc

Inventors

• Bairavasundaram Lakshmi Narayanan
• Soundararajan Gokul
• Mathur Vipul
• Voruganti Kaladhar

Classifications

• Y02D10/00

  Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title

• G06F9/5016 Primary

  the resource being the memory · CPC title

• H04L67/568

  Storing data temporarily at an intermediate stage, e.g. caching · CPC title

• G06F2009/4557

  Distribution of virtual machine instances; Migration and load balancing · CPC title

• H04L41/0816

  the condition being an adaptation, e.g. in response to network events · CPC title