USING BUILD HISTORY INFORMATION TO OPTIMIZE A SOFTWARE BUILD PROCESS

• US 20170206067A1
• Filed: 04/03/2017
• Published: 07/20/2017
• Est. Priority Date: 08/20/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Doyle, Ronald P., Bonanno, James M., Fraenkel, Michael L., Tarter, Aaron J.
• Granted Patent: US 10,649,748 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 8/433 Dependency analysis; Data or control flow analysis
• CPC Class Codes: G06F 8/443 Optimisation
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management

Abstract

Methods and systems for optimizing a build order of component source modules comprises creating a dependency graph based on dependency information. Historical build information associated with previous build failures is then used to calculate relative failure factors for paths of the dependency graph; and the relative failure factors are used to determine an order of traversal of the dependency graph during a build process in which component binary modules are built from the component source modules.

Claims

1-25. -25. (canceled)

26. A computer-implemented method for optimizing a build order of component source modules, comprising:

creating a dependency graph based on dependency information;

calculating, using historical build information associated with previous build failures, relative failure factors for paths of the dependency graph; and

determining, by comparing the relative failure factors, an order of traversal of the dependency graph during a build process, wherein

component binary modules are built from the component source modules during the build process, and

a relative failure factor for a particular path is based upon a percentage of past failures for a particular component source module in the particular path.

27. The method of claim 26, wherein

the dependency graph is a global reverse dependency graph.

28. The method of claim 27, wherein

the global reverse dependency graph is created by reversing directions of edges of a merged global dependency graph.

29. The method of claim 27, wherein

the relative failure factors are calculated by determining a failure factor value for each of a plurality of path options in the global reverse dependency graph.

30. The method of claim 29, wherein

upon the build processor being optimized for failure last, the build process is performed by traversing the global reverse dependency graph using path options having lowest failure factor values.

31. The method of claim 29, wherein

the failure factor value is designated as Q and defined as:

32. The method of claim 29, wherein

upon the build process being optimized for failure first, the build process is performed:

by traversing the global reverse dependency graph, and

using the plurality of path options having a highest failure factor value.

33. A computer hardware system configured to optimize a build order of component source modules, comprising:

at least one hardware processor configured to initiate the following executable operations;

creating a dependency graph based on dependency information;

calculating, using historical build information associated with previous build failures, relative failure factors for paths of the dependency graph; and

determining, by comparing the relative failure factors, an order of traversal of the dependency graph during a build process, wherein

component binary modules are built from the component source modules during the build process, and

a relative failure factor for a particular path is based upon a percentage of past failures for a particular component source module in the particular path.

34. The system of claim 33, wherein

the dependency graph is a global reverse dependency graph.

35. The system of claim 34, wherein

the global reverse dependency graph is created by reversing directions of edges of a merged global dependency graph.

36. The system of claim 34, wherein

the relative failure factors are calculated by determining a failure factor value for each of a plurality of path options in the global reverse dependency graph.

37. The system of claim 36, wherein

upon the build processor being optimized for failure last, the build process is performed by traversing the global reverse dependency graph using path options having lowest failure factor values.

38. The system of claim 36, wherein

the failure factor value is designated as Q and defined as:

39. The system of claim 36, wherein

upon the build process being optimized for failure first, the build process is performed:

by traversing the global reverse dependency graph, and

using the plurality of path options having a highest failure factor value.

40. A computer program product, comprising:

a computer usable hardware storage device having stored therein computer usable program instructions for optimizing a build order of component source modules,

the computer usable program instructions, which when executed on a computer hardware system, causes the computer hardware system to perform;

creating a dependency graph based on dependency information;

calculating, using historical build information associated with previous build failures, relative failure factors for paths of the dependency graph; and

determining, by comparing the relative failure factors, an order of traversal of the dependency graph during a build process, wherein

component binary modules are built from the component source modules during the build process, and

a relative failure factor for a particular path is based upon a percentage of past failures for a particular component source module in the particular path.

41. The computer program product of claim 40, wherein

the dependency graph is a global reverse dependency graph.

42. The computer program product of claim 41, wherein

the global reverse dependency graph is created by reversing directions of edges of a merged global dependency graph.

43. The computer program product of claim 41, wherein

the relative failure factors are calculated by determining a failure factor value for each of a plurality of path options in the global reverse dependency graph.

44. The computer program product of claim 43, wherein

upon the build processor being optimized for failure last, the build process is performed by traversing the global reverse dependency graph using path options having lowest failure factor values.

45. The computer program product of claim 43, wherein

the failure factor value is designated as Q and defined as: