Process-aware code migration

Patent metadata

Field	Value
Publication number	US-9239873-B2
Application number	US-201313926229-A
Country	US
Kind code	B2
Filing date	Jun 25, 2013
Priority date	Jun 25, 2013
Publication date	Jan 19, 2016
Grant date	Jan 19, 2016

Abstract

A mechanism is provided for process-aware code migration. A plurality of nodes and a plurality of edges are annotated within a call graph with information from execution data for executing the code and a topology of the data processing system to form an annotated call graph. Each node in the plurality of nodes is clustered into an associated cluster based on a subset of attributes used from the execution data or the topology to generate the annotated call graph to form a clustered call graph comprising a plurality of clusters. The execution data associated with each cluster in the plurality of clusters is process mined to form an existing process model. Processes identified within the existing process model are mapped to a proposed business-process model thereby forming a set of correlations between the existing process model and the proposed business-process model.

First claim

What is claimed is:

1. A method, in a data processing system, for process-aware code migration, the method comprising:
annotating a plurality of nodes and a plurality of edges within a call graph with information from execution data for executing the code and a topology of the data processing system to form an annotated call graph;
clustering each node in the plurality of nodes into an associated cluster based on a subset of attributes used from the execution data or the topology to generate the annotated call graph to form a clustered call graph comprising a plurality of clusters;
process mining the execution data associated with each cluster in the plurality of clusters to form an existing process model; and
mapping processes identified within the existing process model to a proposed business-process model thereby forming a set of correlations between the existing process model and the proposed business-process model.

2. The method of claim 1 , further comprising:
providing the set of correlations to a client's domain expert.

3. The method of claim 1 , wherein annotating the plurality of nodes and the plurality of edges the call graph causes the plurality of nodes and the plurality of edges to reflect one or more associated attributes associated with one or more of a particular procedure, a procedure call, or a hardware device, wherein the procedure and the procedure call are identified from execution data and wherein the hardware device is identified from a topology of the data processing system.

4. The method of claim 1 , wherein process mining the execution data associated with each cluster in the plurality of clusters further comprises:
logically removing entry and library calls from the execution data;
grouping entries in the execution data together that are part of a same cluster and have identical transaction identification;
generating an abstract activity name for each of the grouped entries; and
generating the existing process model as identified from the call graph, the execution data, and the topology using the abstract activity name for each of the grouped entries.

5. The method of claim 1 , wherein process mining the execution data associated with each cluster in the plurality of clusters further comprises:
logically removing entry and library calls from the execution data;
grouping entries in the execution data together that are part of a same cluster and are in a same time slice;
generating an abstract activity name for each of the grouped entries; and
generating the existing process model as identified from the call graph, the execution data, and the topology using the abstract activity name for each of the grouped entries.

6. The method of claim 1 , wherein the call graph is generated by analyzing source code that realizes a business-process such that a node is generated for each procedure and an edge is generated for each node called by another node, wherein the execution data represents a dynamic behavior of the business-process, and wherein the topology represents hardware of the data processing system and a connectivity of the hardware within the data processing system.

7. The method of claim 1 , wherein clustering each node in the plurality of nodes into an associated cluster comprises:
generating an affinity matrix based on the subset of attributes used from e execution data or the topology to generate the annotated call graph; and
generating the plurality of clusters based on the affinity matrix, wherein each cluster comprises one or more nodes of the plurality of nodes.

8. A computer program product comprising a non-transitory computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
annotate a plurality of nodes and a plurality of edges within a call graph with information from execution data for executing the code and a topology of the data processing system to form an annotated call graph;
cluster each node in the plurality of nodes into an associated cluster based on a subset of attributes used from the execution data or the topology to generate the annotated call graph to form a clustered call graph comprising a plurality of clusters;
process mine the execution data associated with each cluster in the plurality of clusters to form an existing process model; and
map processes identified within the existing process model to a proposed business-process model thereby forming a set of correlations between the existing process model and the proposed business-process model.

9. The computer program product of claim 8 , wherein the computer readable program further causes the computing device to:
provide the set of correlations to a client's domain expert.

10. The computer program product of claim 8 , wherein the computer readable program to annotate the plurality anodes and the plurality of edges the call graph causes the plurality of nodes and the plurality of edges to reflect one or more associated attributes associated with one or more of a particular procedure, a procedure call, or a hardware device, wherein the procedure and the procedure call are identified from execution data and wherein the hardware device is identified from a topology of the data processing system.

11. The computer program product of claim 8 , wherein the computer readable program to process mine the execution data associated with each cluster in plurality of clusters further causes the computing device to:
logically remove entry and library calls from the execution data;
group entries in the execution data together that are part of a same cluster and have identical transaction identification;
generate an abstract activity name for each of the grouped entries; and
generate the existing process model as identified from the call graph, the execution data, and the topology using the abstract activity name for each of the grouped entries.

12. The computer program product of claim 8 , wherein the computer readable program to process mine the execution data associated with each cluster in the plurality of clusters further causes the computing device to:
logically remove entry and library calls from the execution data;
group entries in the execution data together that are part of a same cluster and are in a same time slice;
generate an abstract activity name for each of the grouped entries; and
generate the existing process model as identified from the call graph, the execution data, and the topology using the abstract activity name for each of the grouped entries.

13. The computer program product of claim 8 , wherein the call graph is generated by analyzing source code that realizes a business-process such that a node is generated for each procedure and an edge is generated for each node called by another node, wherein the execution data represents a dynamic behavior of the business-process, and wherein the topology represents hardware of the data processing system and a connectivity of the hardware within the data processing system.

14. The computer program product of claim 8 , wherein the computer readable program to cluster each node in the plurality of nodes into an associated cluster further causes the computing device to:
generate an affinity matrix based on the subset of attributes used from the execution data or the topology to generate the annotated call graph; and
generate the plurality of clusters based on the affinity matrix, wherein each cluster comprises one or more nodes of the plurality of nodes.

15. An apparatus comprising:
a processor;

Assignees

• IBM

Inventors

• Branch Joel W
• Reason Johnathan M
• Rembert Aubrey J

Classifications

• G06F8/76 Primary

  Adapting program code to run in a different environment; Porting · CPC title

• G06F16/285 Primary

  Clustering or classification · CPC title

• G06F17/30598 Primary

  Physics · mapped topic