System and method for autonomous and dynamic resource allocation in storage systems

Patent metadata

Field	Value
Publication number	US-11658920-B2
Application number	US-202117308915-A
Country	US
Kind code	B2
Filing date	May 5, 2021
Priority date	Feb 7, 2020
Publication date	May 23, 2023
Grant date	May 23, 2023

Abstract

Embodiments are described for an autonomously and dynamically allocating resources in a distributed network based on forecasted a-priori CPU resource utilization, rather than a manual throttle setting. A multivariate (CPU idle %, disk I/O, network and memory) rather than single variable approach for Probabilistic Weighted Fuzzy Time Series (PWFTS) is used for forecasting compute resources. The dynamic throttling is combined with an adaptive compute change rate detection and correction. A single spike detection and removal mechanism is used to prevent the application of too many frequent throttling changes. Such a method can be implemented for several use cases including, but not limited to: cloud data migration, replication to a storage server, system upgrades, bandwidth throttling in storage networks, and garbage collection.

First claim

What is claimed is:

1. A computer-implemented method of automatically and dynamically allocating resources in a distributed computer system, comprising:
estimating the completion time of a desired operation;
predicting, using log statistics, compute usage of the system by applying multivariate time-series analysis to produce a usage forecast, wherein the usage forecast defines a number of different usage levels, wherein the time-series analysis is performed using Probabilistic Weighted Fuzzy Time Series (PWFTS) for forecasting compute resource usage;
obtaining, using the using the usage forecast, a transition set comprising transition points occurring at specific times between the different usage levels;
analyzing the transition points to identify single point spike conditions;
removing the single point spikes from the transition set;
setting throttle values for the transition points based on a default throttle map; and
calculating a relative deviation and updating throttle values based on a throttle adjustment map.

2. The method of claim 1 wherein the distributed computer system comprises a storage network executing a deduplication backup process.

3. The method of claim 2 wherein the storage network comprises at least part of a cloud computer network and a virtualized computer network.

4. The method of claim 3 wherein the resources comprise at least one of: central processing unit (CPU) usage, storage disk input/output (I/O) cycles, network bandwidth, and memory space utilization, and wherein the multiple variables of the multivariate time-series analysis comprise at least CPU usage, disk I/O, network bandwidth and memory utilization.

5. The method of claim 4 wherein the desired operation is selected from one of: cloud data migration, replication to a storage server, system upgrades, bandwidth throttling in storage networks, and garbage collection.

6. The method of claim 1 wherein the different usage levels comprise three usage levels denoted low, medium, and high usage.

7. The method of claim 6 wherein the default throttle map defines a throttle value limiting availability of a resource proportional to an increased usage level, and increasing availability of the resource proportional to a decreased usage level.

8. The method of claim 1 wherein the log statistics are obtained by one of a Linux system activity report (sar), an I/O statistics reporter, and a system performance log.

9. The method of claim 7 further comprising allocating resources based on the usage forecast and updated throttle values.

10. A system for automatically and dynamically allocating resources in a distributed computer system, comprising:
a machine learning processing component estimating the completion time of a desired operation, predicting, using log statistics, compute usage of the system by applying multivariate time-series analysis to produce a usage forecast, wherein the usage forecast defines a number of different usage levels, and obtaining, using the using the usage forecast, a transition set comprising transition points occurring at specific times between the different usage levels, wherein the time-series analysis is performed using Probabilistic Weighted Fuzzy Time Series (PWFTS) for forecasting compute resource usage;
an analyzer analyzing the transition points to identify single point spike conditions, removing the single point spikes from the transition set, and setting throttle values for the transition points based on a default throttle map; and
a calculator calculating a relative deviation and updating throttle values based on a throttle adjustment map.

11. The system of claim 10 wherein the distributed computer system comprises a storage network executing a deduplication backup process.

12. The system of claim 11 wherein the storage network comprises at least part of a cloud computer network and a virtualized computer network.

13. The system of claim 12 wherein the resources comprise at least one of: central processing unit (CPU) usage, storage disk input/output (I/O) cycles, network bandwidth, and memory space utilization, and wherein the multiple variables of the multivariate time-series analysis comprise at least CPU usage, disk I/O, network bandwidth and memory utilization.

14. The system of claim 13 wherein the desired operation is selected from one of: cloud data migration, replication to a storage server, system upgrades, bandwidth throttling in storage networks, and garbage collection.

15. The system of claim 10 wherein the different usage levels comprise three usage levels denoted low, medium, and high usage.

16. The system of claim 15 wherein the default throttle map defines a throttle value limiting availability of a resource proportional to an increased usage level, and increasing availability of the resource proportional to a decreased usage level.

17. A computer program product, comprising a non-transitory computer-readable medium having a computer-readable program code embodied therein, the computer-readable program code adapted to be executed by one or more processors to perform a method of allocating replication journal space among multiple applications in a computer backup system, comprising:
estimating the completion time of a desired operation;
predicting, using log statistics, compute usage of the system by applying multivariate time-series analysis to produce a usage forecast, wherein the usage forecast defines a number of different usage levels, wherein the time-series analysis is performed using Probabilistic Weighted Fuzzy Time Series (PWFTS) for forecasting compute resource usage;
obtaining, using the using the usage forecast, a transition set comprising transition points occurring at specific times between the different usage levels;
analyzing the transition points to identify single point spike conditions;
removing the single point spikes from the transition set;
setting throttle values for the transition points based on a default throttle map; and
calculating a relative deviation and updating throttle values based on a throttle adjustment map.

18. The computer program product of claim 17 wherein the distributed computer system comprises a storage network executing a deduplication backup process, and wherein the storage network comprises at least part of a cloud computer network and a virtualized computer network.

19. The computer program product of claim 18 wherein the resources comprise at least one of: central processing unit (CPU) usage, storage disk input/output (I/O) cycles, network bandwidth, and memory space utilization, and wherein the multiple variables of the multivariate time-series analysis comprise at least CPU usage, disk I/O, network bandwidth and memory utilization, and further wherein the desired operation is selected from one of: cloud data migration, replication to a storage server, system upgrades, bandwidth throttling in storage networks, and garbage collection.

Assignees

• Emc Ip Holding Co Llc

Inventors

• Vishwakarma Rahul Deo
• Perneti Jayanth Kumar Reddy
• Singh Gopal

Classifications

• H04L47/783

  Distributed allocation of resources, e.g. bandwidth brokers · CPC title

• G06F9/505

  considering the load · CPC title

• G06N20/20

  Ensemble learning · CPC title

• G06N5/01

  Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound · CPC title

• G06F9/5055

  considering software capabilities, i.e. software resources associated or available to the machine · CPC title