IP Library Granted Patent US 10,339,131
Granted Patent B1
US 10,339,131 · App. 15/620,734 · Granted Jul 2, 2019

Fault prevention

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 10,339,131
App. No.
15/620,734
Granted
Jul 2, 2019
Kind
B1
Abstract

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying a plurality of software components within a cluster of computing nodes, each component operating on one or more respective nodes within the cluster to process a workload; determining, for each identified component, a respective resource usage trend for the component having a respective range of predicted values; comparing, for each identified component, the respective range of predicted values to a respective range of suitable values; and generating, for each component with the respective range of predicted values that is outside of the respective range of suitable values, a respective recommendation for configuring the component to cause the component to generate an updated respective resource usage trend having an updated respective range of predicted values that are inside of the respective range of suitable values.

Claims (66)

1. A method, performed by at least one computing device, comprising:

receiving metrics from a cluster of computer nodes relating to a heap size of a NameNode of a Hadoop Distributed File System on the cluster, the metrics including

a number of directories over a preceding period,

a number of predicted files over the preceding period,

a number of predicted blocks over the preceding period,

a number of predicted snapshot objects over the preceding period,

a size per metadata object (O),

a number of transactions (T), and

an average memory needed per transaction (M);

predicting, by linear regression, corresponding values for the received metrics over a future period, the corresponding values including

a number of directories over the future period (D),

a number of predicted files over the future period (F),

a number of predicted blocks over the future period (B), and

a number of predicted snapshot objects over the future period (S);

determining a value for the heap size of the NameNode over the future period, including

computing an amount of memory MD needed for the metadata objects according to MD=(D+F+B+S)*O,

computing an amount of memory TM needed for the number of transactions according to TM=T*M, and

computing the value for the heap size as MD+TM times a safety factor; and

outputting fault preventive recommendations based at least on the determined value for the heap size.

2. The method of claim 1 , wherein the safety factor is 1.2.

3. The method of claim 1 , wherein the preceding period is six months or twelve months.

4. A system comprising a cluster of computer nodes running a Hadoop Distributed File System, the system comprising:

at least one hardware computing device;

a metrics analyzer configured to be executing by the at least one hardware computing device to perform operations comprising:

receiving metrics from the cluster of computer nodes relating to a heap size of a NameNode of the Hadoop Distributed File System on the cluster, the metrics including

a number of directories over a preceding period,

a number of predicted files over the preceding period,

a number of predicted blocks over the preceding period,

a number of predicted snapshot objects over the preceding period,

a size per metadata object (O),

a number of transactions (T), and

an average memory needed per transaction (M);

a recommendation engine configured to be executing by the at least one hardware computing device to perform operations comprising:

predicting, by linear regression, corresponding values for the received metrics over a future period, the corresponding values including

a number of directories over the future period (D),

a number of predicted files over the future period (F),

a number of predicted blocks over the future period (B), and

a number of predicted snapshot objects over the future period (S);

determining a value for the heap size of the NameNode over the future period, including

computing an amount of memory MD needed for the metadata objects according to MD=(D+F+B+S)*O,

computing an amount of memory TM needed for the number of transactions according to TM=T*M, and

computing the value for the heap size as MD+TM times a safety factor; and

outputting fault preventive recommendations based at least on the determined value for the heap size.

5. The system of claim 4 , wherein the safety factor is 1.2.

6. The system of claim 4 , wherein the preceding period is six months or twelve months.

7. A non-transitory medium storing computer program instructions configured to cause a system to perform operations comprising:

receiving metrics from a cluster of computer nodes relating to a heap size of a NameNode of a Hadoop Distributed File System on the cluster, the metrics including

a number of directories over a preceding period,

a number of predicted files over the preceding period,

a number of predicted blocks over the preceding period,

a number of predicted snapshot objects over the preceding period,

a size per metadata object (O),

a number of transactions (T), and

an average memory needed per transaction (M);

predicting, by linear regression, corresponding values for the received metrics over a future period, the corresponding values including

a number of directories over the future period (D),

a number of predicted files over the future period (F),

a number of predicted blocks over the future period (B), and

a number of predicted snapshot objects over the future period (S);

determining a value for the heap size of the NameNode over the future period, including

computing an amount of memory MD needed for the metadata objects according to MD=(D+F+B+S)*O,

computing an amount of memory TM needed for the number of transactions according to TM=T*M, and

computing the value for the heap size as MD+TM times a safety factor; and

outputting fault preventive recommendations based at least on the determined value for the heap size.

8. The non-transitory medium of claim 7 , wherein the safety factor is 1.2.

9. The non-transitory medium of claim 7 , wherein the preceding period is six months or twelve months.

Assignments (7)
RELEASE OF SECURITY INTERESTS IN PATENTS Recorded Oct 14, 2021
From: CITIBANK, N.A.
To: CLOUDERA, INC.; HORTONWORKS, INC.
Reel/Frame 057804/0355 →
SECOND LIEN NOTICE AND CONFIRMATION OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Oct 12, 2021
From: CLOUDERA, INC.; HORTONWORKS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 057776/0284 →
FIRST LIEN NOTICE AND CONFIRMATION OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Oct 12, 2021
From: CLOUDERA, INC.; HORTONWORKS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 057776/0185 →
SECURITY INTEREST Recorded Dec 22, 2020
From: CLOUDERA, INC.; HORTONWORKS, INC.
To: CITIBANK, N.A., AS COLLATERAL AGENT
Reel/Frame 054832/0559 →
RELEASE OF SECURITY INTEREST IN INTELLECTUAL PROPERTY AT REEL/FRAME NO. 44680/0718 Recorded Dec 16, 2020
From: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
To: HORTONWORKS, INC.
Reel/Frame 054789/0415 →
FIRST SUPPLEMENT TO INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Nov 2, 2017
From: HORTONWORKS, INC.
To: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
Reel/Frame 044680/0718 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2017
From: DOLAS, SHEETAL DINKAR; CODDING, PAUL DANIEL
To: HORTONWORKS, INC.
Reel/Frame 042774/0829 →
Cited By (1)
US 12,537,745