System resource component utilization
US-10102103-B2 · Oct 16, 2018 · US
US10423516B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10423516-B2 |
| Application number | US-201816121552-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 4, 2018 |
| Priority date | Nov 11, 2015 |
| Publication date | Sep 24, 2019 |
| Grant date | Sep 24, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A computer-implemented method according to one embodiment includes receiving, by one or more processors, a set of utilization metrics for a system comprising at least an average number of concurrent requests N to the system and a maximum concurrency c that the system is capable of supporting, computing, by one or more processors, a tipping point p, computing, by one or more processors, a utilization U according to a ratio of the average number of concurrent requests N to a function, where the function is defined as: c+f(f(N/p)) for N<p, and N+1+b*f(p/N) for N≥p, where b=c−p and f(y)=y−b*y*(1−y)+0.5*b*(b−1)*y*(1−y) 2 , and adjusting, by one or more processors, the system, utilizing the utilization U.
Opening claim text (preview).
What is claimed is: 1. A computer implemented method, comprising: receiving, by one or more processors, a set of utilization metrics for a system comprising at least an average number of concurrent requests N to the system and a maximum concurrency c that the system supports; computing, by one or more processors, a tipping point p; computing, by one or more processors, a utilization U according to a ratio of the average number of concurrent requests N to a function, where the function is defined as: c+f ( f ( N/p )) for N<p , and N+ 1+ b*f ( p/N ) for N≥p, where b=c−p and f(y)=y−b*y*(1−y)+0.5*b*(b−1)*y*(1−y) 2 ; and adjusting, by one or more processors, the system, utilizing the utilization U. 2. The method of claim 1 , wherein adjusting the system, utilizing the utilization U, comprises: identifying, by one or more processors, components of the system that exhibit a predetermined utilization; and adjusting, by one or more processors, the system to balance the utilization U across available components. 3. The method of claim 1 , wherein the maximum concurrency c corresponds to an entire computer system. 4. The method of claim 1 , wherein the maximum concurrency c corresponds to one or more applications of interest. 5. The method of claim 1 , further comprising analyzing the utilization U to determine if the system or individual components of the system are being over-utilized. 6. The method of claim 1 , further comprising: identifying, by one or more processors, components of the system that exhibit a high utilization, and adjusting, by one or more processors, the system to balance the utilization across available components. 7. The method of claim 1 , wherein adjusting the system includes introducing, by one or more processors, additional components to the system to help balance a workload. 8. The method of claim 1 , further comprising computing, by one or more processors, an extended harmonic number G(c) according to an equation G(c)=2*D{H [c+1] −1/(2*[c]+2.52)}+(1−2*D)*H d , wherein D is a distance between c and a nearest integer d, H d is a d th harmonic number, and [c] denotes a greatest integer function of c. 9. The method of claim 8 , wherein the tipping point p is computed according to an equation p=c−G(c+2)+G(3)+1.6/(c+7)−9.6/(c+47). 10. The method of claim 1 , wherein the function is represented by FixP D (N). 11. The method of claim 10 , wherein the utilization U is computed according to an equation U=N/FixP D (N). 12. A computer program product for computing a system utilization, the computer program product comprising: one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions, executable by a computer, comprising instructions to: receive, by one or more processors, a set of utilization metrics for a system comprising at least an average number of concurrent requests N to the system and a maximum concurrency c that the system supports; compute, by one or more processors, a tipping point p; compute, by one or more processors, a utilization U according to a ratio of the average number of concurrent requests N to a function, where the function is defined as: c+f ( f ( N/p )) for N<p , and N+ 1+ b*f ( p/N ) for N≥p, where b=c−p and f(y)=y−b*y*(1−y)+0.5*b*(b−1)*y*(1−y) 2 ; and adjust, by one or more processors, the system, utilizing the utilization U. 13. The computer program product of claim 12 , wherein adjusting the system, utilizing the utilization U, comprises: identifying, by one or more processors, components of the system that exhibit a predetermined utilization; and adjusting, by one or more processors, the system to balance the utilization U across available components. 14. The computer program product of claim 12 , wherein the maximum concurrency c corresponds to an entire computer system. 15. The computer program product of claim 12 , wherein the maximum concurrency c corresponds to one or more applications of interest. 16. The computer program product of claim 12 , further comprising program instructions to analyze the utilization U to determine if the system or individual components of the system are being over-utilized. 17. The computer program product of claim 12 , further comprising: program instructions to identify, by one or more processors, components of the system that exhibit a high utilization, and program instructions to adjust, by one or more processors, the system to balance the utilization across available components. 18. The computer program product of claim 12 , wherein adjusting the system includes introducing, by one or more processors, additional components to the system to help balance a workload. 19. The computer program product of claim 12 , further comprising program instructions to compute, by one or more processors, an extended harmonic number G(c) according to an equation G(c)=2*D{H [c+1] −1/(2*[c]+2.52)}+(1−2*D)*H d , wherein D is a distance between c and a nearest integer d, H d is a d th harmonic number, and [c] denotes a greatest integer function of c. 20. A system, comprising one or more processors for: receiving, by the one or more processors, a set of utilization metrics for a system comprising at least an average number of concurrent requests N to the system and a maximum concurrency c that the system supports; computing, by the one or more processors, a tipping point p; computing, by the one or more processors, a utilization U according to a ratio of the average number of concurrent requests N to a function, where the function is defined as: c+f ( f ( N/p )) for N<p , and N+ 1+ b*f ( p/N ) for N≥p, where b=c−p and f(y)=y−b*y*(1−y)+0.5*b*(b−1)*y*(1−y) 2 ; and adjusting, by one or more processors, the system, utilizing the utilization U.
for performance assessment · CPC title
Performance evaluation by statistical analysis · CPC title
by exceeding limits · CPC title
the processing taking place on a specific hardware platform or in a specific software environment · CPC title
for systems · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.