System deconstruction for component substitution

• US 9,589,021 B2
• Filed: 01/14/2011
• Issued: 03/07/2017
• Est. Priority Date: 10/26/2011
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: Shah, Amip J, Marwah, Manish
• Primary Examiner(s): Saeed, Usmaan
• Assistant Examiner(s): VO, CECILE H
• Application Number:
  US13/007,252
• Publication Number:
  US 20120185508A1
• Time in Patent Office: 2,244 Days
• Field of Search: 707/709, 707/797, 707/737, 707/772, 707/784, 707/692, 707/648, 707/705, 707/602, 707/780, 707/999.1, 707/E17.046, 707/E17.012, 707/E17.087, 707/E17.089, 707/E17.05, 707/E17.044, 707/999.101, 707/999.102, 707/802, 707/803, 707/E17.005, 707/E17.011, 707/723, 707/748, 707/749, 707/966, 707/999.107, 370/252, 370/400, 715/762, 715/272, 715/243, 715/234, 715/713, 715/700, 715/213, 714/37, 705/7.25, 705/7.36, 717/127, 717/131, 709/223
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24558 Binary matching operations
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence

Abstract

A method is provided for system deconstruction for component substitution. The method includes a system tree which is deconstructed in a computer-readable medium, the system tree deconstructing into constituent nodes. Each node in the system tree represents a characteristic of a component of a system under consideration. A database of trees is searched for trees containing similar attributes to the system tree. Trees are qualified based on a frequency of nodes that are similar to certain highly ranked nodes in the system tree. The most relevant nodes from the qualified trees are selected. Searching the database is terminated when the most relevant nodes account for a fraction, less than a whole, of an environmental footprint of the system tree.

Claims

1. A method, the method carried out by program code stored on non-transient computer-readable medium and executed by a processor, the method comprising:

deconstructing a first system tree in a computer-readable medium, the first system tree deconstructing into a first plurality of constituent nodes, each node in the first system tree representing a characteristic of a component of a system under consideration;

searching a database of trees for a plurality of trees containing similar attributes to the first system tree, within an inputted band of variability, across key system characteristics;

ranking each of the first nodes according to their respective environmental impact in relation to a plurality of relevant nodes such that a second plurality of environmentally unfriendly nodes are ranked highly;

qualifying a second tree of the plurality of trees based on a frequency of nodes in the second tree that are similar to the second environmentally unfriendly nodes;

selecting a third plurality of most relevant nodes from the second tree, wherein the searching the database is terminated when the third nodes reach a threshold, the threshold representing a fraction, less than a whole, of an environmental footprint of the first system tree; and

replacing, in the first system tree, the second nodes with the third nodes.

2. The method of claim 1, wherein replacing the second nodes with the third nodes reduces the environmental footprint of the system tree.

3. The method of claim 1, wherein each node representing a characteristic of a component of the system under consideration can be disaggregated into a plurality of nodes.

4. The method of claim 1, wherein the first nodes are arranged in the first system tree based on parent-child relationships between each of the first nodes.

5. The method of claim 1, wherein searching the database of trees comprises detecting trees with a similar structure to the first system tree.

6. The method of claim 1, wherein searching the database of trees comprises sequentially searching the database of trees for trees containing attributes within the band of variability.

7. The method of claim 1, wherein qualifying the second tree narrows the plurality of trees resulting from the searching the database based on frequency of similar nodes in the plurality of trees, structure of the plurality of trees, and number of branches in the plurality of trees.

8. The method of claim 1, further comprising prioritizing node searches based on relative impact of the first nodes with respect to one another.

9. The method of claim 1, further comprising terminating the searching the database after a predetermined portion of an overall impact for the first system tree is satisfied.

10. The method of claim 1, further comprising labeling the second nodes as offending nodes.

11. A system comprising:

a non-transitory computer readable storage to store a first system tree having a first plurality of nodes, each of the first nodes in the first system tree representing a characteristic of a component of a system under consideration; and

an analysis engine operatively associated with the non-transitory computer readable storage to deconstruct the first system tree into the first plurality of nodes, the analysis engine searching a database of trees for a plurality of trees containing similar attributes to the first system tree, within an inputted band of variability, across key system characteristics, the analysis engine ranking each of the first nodes according to their respective environmental impact in relation to a plurality of relevant nodes such that a second plurality of environmentally unfriendly nodes are ranked highly, the analysis engine qualifying a second tree of the plurality of trees based on a frequency of nodes in the second tree that are similar to the second environmentally unfriendly nodes, the analysis engine selecting a third plurality of most relevant nodes from the second tree, wherein the analysis engine terminates the searching the database when the third nodes reach a fraction, less than a whole, of an environmental footprint of the first system tree, and the analysis engine replacing, in the first system tree, the second nodes with the third nodes.

12. The system of claim 11, further comprising a substitution and design module called by the analysis engine, the module selecting most relevant nodes from the other trees by at least one of:

prioritizing the third nodes, terminating nodes, and searching nodes hierarchically.

13. The system of claim 12, wherein the substitution and design module compares nodes in the second tree.

14. The system of claim 12, wherein the substitution and design module compares trees.

15. The system of claim 11, wherein the analysis engine sequentially searches the database of trees for trees containing attributes within the band of variability.

16. The system of claim 11, wherein the analysis engine qualifies the second tree by narrowing the plurality of trees resulting from searching the database based on frequency of similar nodes in the plurality of trees, structure of the plurality of trees, and number of branches in the plurality of trees.

17. The system of claim 11, wherein the analysis engine prioritizes node searches based on relative impact of the first nodes with respect to one another.

18. The system of claim 11, wherein the analysis engine terminates the searching the database after a predetermined portion of an overall impact for the first system tree is satisfied.

19. A system, comprising:

a processor;

a non-transitory storage medium to store instructions executed by the processor to implement an analysis engine operatively associated with computer readable storage to deconstruct a first system tree into a first plurality of constituent nodes, each of the first plurality of nodes in the first system tree representing a characteristic of a component of a system under consideration, the analysis engine searching a database of trees for a plurality of trees containing similar attributes to the first system tree, within an inputted band of variability, across key system characteristics, the analysis engine ranking each of the first nodes according to their respective environmental impact in relation to a plurality of relevant nodes such that a second plurality of environmentally unfriendly nodes are ranked highly, and the analysis engine qualifying a second tree based on a frequency of nodes in the second tree that are similar to the second environmentally unfriendly nodes; and

the non-transitory storage medium to further store instructions executed by the processor to implement a substitution and design module called by the analysis engine, the module selecting a third plurality of most relevant nodes from the second tree, wherein the searching the database is terminated when the third nodes reach a threshold, the threshold representing a fraction, less than a whole, of an environmental footprint of the system tree, the module further to replace in the first system tree, the second nodes with the third nodes.

20. The system of claim 19, wherein the analysis engine prioritizes node searches based on relative impact of the first nodes with respect to one another, and the analysis engine terminates the searching the database after a predetermined portion of an overall impact for the first system tree is satisfied.