IP Library Granted Patent US 9,350,627
Granted Patent B2
US 9,350,627 · App. 13/650,767 · Granted May 24, 2016

Automated service time estimation method for IT system resources

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,350,627
App. No.
13/650,767
Granted
May 24, 2016
Kind
B2
Abstract

Embodiments provide a method for upgrading resources in a system including normalizing a collected dataset, scattering data from the normalized dataset, obtaining a plurality of clusters based on the scattered data, discarding one or more clusters from the plurality of clusters with less than a percentage of a total number of observations, in each cluster, performing clusterwise regression and obtaining linear sub-clusters in a defined number, reducing one or more sub-clusters including applying a refinement procedure, removing one or more sub-clusters that fit to outliers and merging pairs of clusters that fit an equivalent model, updating one or more clusters with the reduced sub-clusters, removing one or more globular clusters, reducing a number of clusters with the refinement procedure, and de-normalizing one or more results.

Claims (49)

1. A method for upgrading or allocating resources, the method comprising:

collecting, by least at least one processor, a dataset by sampling utilization versus workload of resources in an Information Technology (IT) computer system, the resources of the IT computer system including hardware and software IT resources, the dataset including aggregate measurements of workload and utilization over time;

analyzing, by the least one processor, the collected dataset to obtain a service time estimation using a refinement enhanced clusterwise regression process, the service time estimation being a parameter relating to an estimated time required to process a request by the IT computer system, the refinement enhanced clusterwise regression process including:

normalizing, by the least one processor, the collected dataset;

scattering, by the least one processor, data from the normalized dataset;

obtaining, by the least one processor, a plurality of clusters based on the scattered data;

discarding, by the least one processor, one or more clusters from the plurality of clusters with less than a percentage of a total number of observations;

in each cluster, performing, by the least one processor, clusterwise regression and obtaining linear sub-clusters in a defined number;

reducing, by the least one processor, one or more sub-clusters including applying a refinement procedure, removing one or more sub-clusters that fit to outliers and merging pairs of clusters that fit an equivalent model;

updating, by the least one processor, one or more clusters with the reduced sub-clusters;

removing, by the least one processor, one or more globular clusters;

reducing, by the least one processor, a number of clusters with the refinement procedure; and

de-normalizing, by the least one processor, data of the reduced number of clusters, wherein the service time estimation is computed from a slope of a regression line of a given cluster in the reduced number of clusters; and

upgrading or allocating at least a portion of the resources of the IT computer system based on the service time estimation.

2. The method of claim 1 , wherein the refinement procedure includes a merging step, wherein a delta is computed for each cluster and then a pair that, when merged, gives origin to the cluster with a smallest increase in cluster delta is found, then

if the increase of the delta is below a threshold, the pair of clusters is merged and one or more new regression lines is computed and then the refinement procedure is started again, otherwise the merging step is ended.

3. The method of claim 2 , wherein the refinement procedure provides that,

given a cluster C 1 , an associated regression line defined by coefficients (R i , S f ), and a point (X j , U j ), let d(i,j) be the orthogonal distance of the point from the regression line, the following steps are performed,

for each cluster C i the distances d(i,j) for j=1, |C i | is computed and considered a random sample from an unknown distribution, and

assuming δρ(C i ) the p-percentile of said sample, a point j is considered inliner with respect to a cluster if d(i,j)<1.5δ 0.9 (C i ), then

if more than a certain percentage T i of the points of the cluster are inliners with respect to other clusters or if less than T p points are not inliners with respect to other clusters, the cluster is removed, its points reassigned to the closest cluster and a local search is performed.

4. The method of claim 2 , wherein the refinement procedure provides

assigning the points of one cluster to other clusters and checking which cluster suffers the biggest delta increase, then finding the cluster that, when having all its points assigned to other clusters, gives origin to the smallest max increase in delta, then

if delta increase is below a predetermined threshold, said cluster is actually removed.

5. The method of claim 1 , further comprising a visual mining procedure including:

calculating a silhouette value for each point to measure strength of point to cluster membership;

choosing a value for a threshold; and

outputting at least one chart.

6. The method of claim 1 , wherein the at least one chart includes a silhouette-time chart, a cardinality-time chart, a parameter-time chart, an hour of day chart, a day of week chart, and a timetable chart.

7. A non-transitory computer readable medium including executable instructions that when executed cause at least one processor to:

collect a dataset by sampling utilization versus workload of resources in an Information Technology (IT) computer system, the resources of the IT computer system including hardware and software IT resources, the dataset including aggregate measurements of workload and utilization over time;

analyze the collected dataset to obtain a service time estimation using a refinement enhanced clusterwise regression process, the service time estimation being a parameter relating to an estimated time required to process a request by the IT computer system, the refinement enhanced clusterwise regression process including:

normalize the collected dataset;

scatter data from the normalized dataset;

obtain a plurality of clusters based on the scattered data;

discard one or more clusters from the plurality of clusters with less than a percentage of a total number of observations;

in each cluster, perform clusterwise regression and obtaining linear sub-clusters in a defined number;

reduce one or more sub-clusters including applying a refinement procedure, removing one or more sub-clusters that fit to outliers and merging pairs of clusters that fit an equivalent model;

update one or more clusters with the reduced sub-clusters;

remove one or more globular clusters;

reduce a number of clusters with the refinement procedure; and

de-normalize data of the reduced number of clusters, wherein the service time estimation is computed from a slope of a regression line of a given cluster in the reduced number of clusters; and

upgrading or allocating at least a portion of the resources of the IT computer system based on the service time estimation.

8. The non-transitory computer readable medium of claim 7 , wherein the refinement procedure includes a merging step, wherein a delta is computed for each cluster and then a pair that, when merged, gives origin to the cluster with a smallest increase in cluster delta is found, then if the increase of the delta is below a threshold, the pair of clusters is merged and one or more new regression lines is computed and then the refinement procedure is started again, otherwise the merging step is ended.

9. The non-transitory computer readable medium of claim 7 , wherein the executable instructions cause the at least one processor to:

calculate a silhouette value for each point to measure strength of point to cluster membership;

choose a value for a threshold; and

output at least one chart.

10. The non-transitory computer readable medium of claim 9 , wherein the at least one chart includes a silhouette-time chart, a cardinality-time chart, a parameter-time chart, an hour of day chart, a day of week chart, and a timetable chart.

Assignments (15)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 7, 2025
From: BMC SOFTWARE, INC.
To: BMC HELIX, INC.
Reel/Frame 070442/0197 →
GRANT OF FIRST LIEN SECURITY INTEREST IN PATENT RIGHTS Recorded Nov 13, 2024
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: GOLDMAN SACHS BANK USA, AS COLLATERAL AGENT
Reel/Frame 069352/0628 →
GRANT OF SECOND LIEN SECURITY INTEREST IN PATENT RIGHTS Recorded Nov 13, 2024
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: GOLDMAN SACHS BANK USA, AS COLLATERAL AGENT
Reel/Frame 069352/0568 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (052854/0139) Recorded Aug 6, 2024
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
To: BMC SOFTWARE, INC.; BLADELOGIC, INC.
Reel/Frame 068339/0617 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (052844/0646) Recorded Aug 6, 2024
From: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
To: BMC SOFTWARE, INC.; BLADELOGIC, INC.
Reel/Frame 068339/0408 →
OMNIBUS ASSIGNMENT OF SECURITY INTERESTS IN PATENT COLLATERAL Recorded Mar 4, 2024
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, AS RESIGNING COLLATERAL AGENT
To: GOLDMAN SACHS BANK USA, AS SUCCESSOR COLLATERAL AGENT
Reel/Frame 066729/0889 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Feb 1, 2024
From: ALTER DOMUS (US) LLC
To: BMC SOFTWARE, INC.; BLADELOGIC, INC.
Reel/Frame 066567/0283 →
GRANT OF SECOND LIEN SECURITY INTEREST IN PATENT RIGHTS Recorded Sep 30, 2021
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: ALTER DOMUS (US) LLC
Reel/Frame 057683/0582 →
SECURITY INTEREST Recorded Jun 4, 2020
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
Reel/Frame 052844/0646 →
SECURITY INTEREST Recorded Jun 4, 2020
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: THE BANK OF NEW YORK MELLON TRUST COMPANY, N.A., AS COLLATERAL AGENT
Reel/Frame 052854/0139 →
RELEASE OF PATENTS Recorded Oct 5, 2018
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: BMC SOFTWARE, INC.; BLADELOGIC, INC.; BMC ACQUISITION L.L.C.
Reel/Frame 047198/0468 →
SECURITY INTEREST Recorded Oct 2, 2018
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: CREDIT SUISSE, AG, CAYMAN ISLANDS BRANCH, AS COLLATERAL AGENT
Reel/Frame 047185/0744 →
SECURITY INTEREST Recorded Aug 10, 2017
From: BMC SOFTWARE, INC.; BLADELOGIC, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, AS COLLATERAL AGENT
Reel/Frame 043514/0845 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 20, 2016
From: CAPLAN SOFTWARE DEVELOPMENT S.R.L.
To: BMC SOFTWARE, INC.
Reel/Frame 038332/0475 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 25, 2014
From: CREMONESI, PAOLO; DHYANI, KANIKA; VISCONTI, STEFANO
To: CAPLAN SOFTWARE DEVELOPMENT S.R.L.
Reel/Frame 032295/0347 →