Pre-starting services based on traversal of a directed graph during execution of an application

A computer program product, comprising one or more computer readable hardware storage devices having computer readable program code stored therein, said program code containing instructions executable by one or more processors of a computer system to implement a method for which a service call is referred to as an event and processing the service call is referred to as an action, said method comprising:

• generating, by the one or more processors, a directed graph for an application, said directed graph having vertices representing services and edges representing events, said directed graph providing a map of process flow of the application;
• associating, by the one or more processors, a traversal probability with each event in the directed graph;
• monitoring, by the one or more processors, traversal of the directed graph during an execution of the application and continually revising traversal probabilities for events in the directed graph which may still occur during the execution of the application;
• applying, by the one or more processors, decision logic during the execution of the application to decide whether to pre-start one service in the directed graph that may still be called prior to an event in the directed graph calling the one service;
• and
• pre-starting, by the one or more processors, the one service decided upon by the decision logic.

A computer system, comprising one or more processors, one or more memories, and one or more computer readable hardware storage devices, said one or more hardware storage device containing program code executable by the one or more processors via the one or more memories to implement a method for which a service call is referred to as an event and processing the service call is referred to as an action, said method comprising:

• generating, by the one or more processors, a directed graph for an application, said directed graph having vertices representing services and edges representing events, said directed graph providing a map of process flow of the application;
• associating, by the one or more processors, a traversal probability with each event in the directed graph;
• monitoring, by the one or more processors, traversal of the directed graph during an execution of the application and continually revising traversal probabilities for events in the directed graph which may still occur during the execution of the application;
• applying, by the one or more processors, decision logic during the execution of the application to decide whether to pre-start one service in the directed graph that may still be called prior to an event in the directed graph calling the one service;
• and
• pre-starting, by the one or more processors, the one service decided upon by the decision logic.