Method, system, and computer program product for optimizing runtime branch selection in a flow process

• US 8,984,259 B2
• Filed: 11/04/2008
• Issued: 03/17/2015
• Est. Priority Date: 11/04/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hulse, Brian, Jackson, Callum P., Kalus, Christopher, Parkinson, Ian W., Phippen, Robert W., Watkinson, Amanda J.
• Primary Examiner(s): Caldwell, Andrew
• Assistant Examiner(s): LINDLOF, JOHN M
• Application Number:
  US12/264,385
• Publication Number:
  US 20100115251A1
• Time in Patent Office: 2,324 Days
• US Class Current: 712/214
• CPC Class Codes: G06F 2209/508 Monitor
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups

Abstract

A method, system, and computer program product for optimizing runtime branch selection in a flow process are provided. The method includes gathering performance metrics of flow branch behavior for executed flows in a runtime system over time and using aggregated performance metrics for the behavior to determine an optimal ordering of branches for a currently running flow. The optimal ordering is determined by identifying one or more branch points in the flow, generating ordering permutations for at least a portion of the branches in the branch point for the flow to identify any permutations that have not been executed, gathering metrics for permutation(s) of the branch point in the flow, comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior, and identifying optimal branch ordering for the permutation(s) based upon the comparison. The method also includes executing the flow according to the optimal branch ordering.

Claims

1. A method for optimizing runtime branch selection in a flow process of an enterprise service bus of a service-oriented architecture, comprising:

gathering, by a runtime branch collector, performance metrics of flow branch behavior for executed flows in a runtime system of the enterprise service bus of the service-oriented architecture over a period of time;

passing the performance metrics for the flow branch behavior from the runtime branch collector to a global runtime metric collector, the global runtime metric collector comprising a central repository for containing performance metrics for a plurality of types of flows and flow branches as routes of messages in the runtime system of the enterprise service bus;

using, by a global runtime branch switch director, the performance metrics for the flow branch behavior from the global runtime metric collector to determine an optimal ordering of branches for a currently running flow of the enterprise service bus of the service-oriented architecture, comprising;

identifying a branch point in the currently running flow by the global runtime branch switch director, the branch point having two or more branches that are taken from the branch point according to a branch ordering;

generating all ordering permutations, by the global runtime branch switch director, for at least a portion of the branches in the branch point for the currently running flow and identifying any permutations that have not been executed from the ordering permutations;

gathering metrics, by the runtime branch collector, for at least one permutation of the branch point in the currently running flow;

comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior by searching the global runtime metric collector for similar flows; and

identifying, by the global runtime branch switch director, optimal branch ordering for the permutation based upon the comparison and data associated between the two or more branches; and

executing the flow, by a flow engine, according to the optimal branch ordering as directed by the global runtime branch switch director such that a runtime branch switch of the flow engine is directed with the optimal branch ordering at each branch encountered.

2. The method of claim 1, wherein the optimal branch ordering is determined by identifying a permutation from the stored performance metrics that, based upon past executions, is determined to execute faster than other permutations from the stored performance metrics or is determined to use fewer resources to complete than other permutations from the stored performance metrics.

3. The method of claim 2, wherein gathering the metrics includes gathering load values that reflect time spent completing a flow branch;

wherein an average load value is calculated by averaging load values for multiple activated flow branches.

4. The method of claim 2, wherein gathering the metrics includes identifying common branches taken in a flow.

5. The method of claim 1, further comprising:

updating the stored performance metrics with statistical data reflecting execution of the flow using the optimal branch ordering.

6. The method of claim 1, wherein the permutation indicates a path of the branch point and reflects a particular sequence of tasks in the flow.

7. A method for optimizing runtime branch selection in a statically-configured flow process of an enterprise service bus of a service-oriented architecture, comprising:

identifying, by a global runtime branch switch director of a runtime system, flow branch behavior for flows in the runtime system of the enterprise service bus of the service-oriented architecture for instantiating conceptual flows of an application, the flow branch behavior including locations in a flow where clones of data are taken;

reducing, by the global runtime branch switch director, the number of clones of data otherwise created at runtime of the enterprise service bus by selecting any branches that, upon execution, would require cloning of data associated with another branch having a common branch point, wherein each branch represents a different route of messages in the runtime system of the enterprise service bus; and

instructing, by the global runtime branch switch director, a flow engine of the runtime system to execute the selected branches before executing the other branch by changing a branch ordering at the common branch point.

8. The method of claim 7, wherein identifying flow branch behavior in a runtime system further includes:

identifying asynchronous and synchronous service calls in a flow;

determining a runtime of the asynchronous and synchronous service calls using a corresponding timeout value; and

ordering execution of the asynchronous and synchronous service calls, using the time out value, such that short-lived synchronous calls are executed while waiting for long-lived asynchronous service calls in the flow.

9. A system for optimizing runtime branch selection in a flow process of an enterprise service bus of a service-oriented architecture, comprising:

a computer processor; and

a runtime system application executing on the computer processor, the runtime system application implementing a method, comprising;

gathering, by a runtime branch collector, performance metrics of flow branch behavior for executed flows in a runtime system of the enterprise service bus of the service-oriented architecture over a period of time;

passing the performance metrics for the flow branch behavior from the runtime branch collector to a global runtime metric collector, the global runtime metric collector comprising a central repository for containing performance metrics for a plurality of types of flows and flow branches as routes of messages in the runtime system of the enterprise service bus;

using, by a global runtime branch switch director, the performance metrics for the flow branch behavior from the global runtime metric collector to determine an optimal ordering of branches for a currently running flow of the enterprise service bus of the service-oriented architecture, comprising;

identifying a branch point in the currently running flow by the global runtime branch switch director, the branch point having two or more branches that are taken from the branch point according to a branch ordering;

generating all ordering permutations, by the global runtime branch switch director, for at least a portion of the branches of the branch point in the currently running flow and identifying any permutations that have not been executed from the ordering permutations;

gathering metrics, by the runtime branch collector, for at least one permutation of the branch point in the currently running flow;

comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior by searching the global runtime metric collector for similar flows; and

identifying, by the global runtime branch switch director, optimal branch ordering for the permutation based upon the comparison and data associated between the two or more branches; and

executing the flow, by a flow engine, according to the optimal branch ordering as directed by the global runtime branch switch director such that a runtime branch switch of the flow engine is directed with the optimal branch ordering at each branch encountered.

10. The system of claim 9, wherein the optimal branch ordering is determined by identifying a permutation from the stored performance metrics that, based upon past executions, is determined to execute faster than other permutations from the stored performance metrics or is determined to use fewer resources to complete than other permutations from the stored performance metrics.

11. The system of claim 10, wherein gathering the metrics includes gathering load values that reflect time spent completing a flow branch;

wherein an average load value is calculated by averaging load values for multiple activated flow branches.

12. The system of claim 10, wherein gathering the metrics includes identifying common branches taken in a flow.

13. The system of claim 9, wherein the system runtime application further implements:

updating the stored performance metrics with statistical data reflecting execution of the flow using the optimal branch ordering.

14. The system of claim 9, wherein the permutation indicates a path of the branch point and reflects a particular sequence of tasks in the flow.

15. A computer program product for optimizing runtime branch selection in a flow process of an enterprise service bus of a service-oriented architecture, the computer program product comprising a non-transitory storage medium having computer-readable program code stored thereon, the program code causing a computer to implement a method, the method comprising:

gathering, by a runtime branch collector, performance metrics of flow branch behavior for executed flows in a runtime system of the enterprise service bus of the service-oriented architecture over a period of time;

passing the performance metrics for the flow branch behavior from the runtime branch collector to a global runtime metric collector the global runtime metric collector comprising a central repository for containing performance metrics for a plurality of types of flows and flow branches as routes of messages in the runtime system of the enterprise service bus;

using, by a global runtime branch switch director, the performance metrics for the flow branch behavior from the global runtime metric collector to determine an optimal ordering of branches for a currently running flow of the enterprise service bus of the service-oriented architecture, comprising;

identifying a one branch point in the currently running flow by the global runtime branch switch director, the branch point having two or more branches that are taken from the branch point according to a branch ordering;

generating all ordering permutations, by the global runtime branch switch director, for at least a portion of the branches in the branch point for the currently running flow and identifying any permutations that have not been executed from the ordering permutations;

gathering metrics, by the runtime branch collector, for at least one permutation of the branch point in the currently running flow;

comparing the metrics to performance metrics of executed flows having substantially similar flow branch behavior by searching the runtime metric collector for similar flows; and

identifying, by the global runtime branch switch director, optimal branch ordering for the permutation based upon the comparison and data associated between the two or more branches; and

executing the flow, by a flow engine, according to the optimal branch ordering as directed by the global runtime branch switch director such that a runtime branch switch of the flow engine is directed with the optimal branch ordering at each branch encountered.

16. The computer program product of claim 15, wherein the optimal branch ordering is determined by identifying a permutation from the stored performance metrics that, based upon past executions, is determined to execute faster than other permutations from the stored performance metrics or is determined to use fewer resources to complete than other permutations from the stored performance metrics.

17. The computer program product of claim 16, wherein gathering the metrics includes gathering load values that reflect time spent completing a flow branch;

wherein an average load value is calculated by averaging load values for multiple activated flow branches.

18. The computer program product of claim 16, wherein gathering the metrics includes identifying common branches taken in a flow.

19. The computer program product of claim 15, further comprising instructions for implementing:

updating the stored performance metrics with statistical data reflecting execution of the flow using the optimal branch ordering.

20. The computer program product of claim 15, wherein the permutation indicates a path of the branch point and reflects a particular sequence of tasks in the flow.