OPTIMIZATIONS USING A BPEL COMPILER

• US 20130086568A1
• Filed: 01/27/2012
• Published: 04/04/2013
• Est. Priority Date: 09/30/2011
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Krishnamurthy, Sanjay M.
• Granted Patent: US 8,954,942 B2
• Time in Patent Office: Days
• US Class Current: 717/154
• CPC Class Codes: G06F 8/443 Optimisation
• CPC Class Codes: G06F 9/4493 Object persistence

Abstract

Various arrangements for reducing a size of a Business Process Execution Language (BPEL) data blob for storage may be presented. One or more dehydration points within compiled BPEL code may be identified. A liveness analysis for the one or more dehydration points may be performed. At each of the one or more dehydration points, one or more live variables from a set of variables may be identified. An optimization data structure may be created for each dehydration point identifies the one or more live variables.

Claims

1. A method for reducing a size of a Business Process Execution Language (BPEL) data blob for storage, the method comprising:

identifying, by a computer system, one or more dehydration points within BPEL code;

performing, by the computer system, a liveness analysis for the one or more dehydration points;

identifying, by the computer system, at each of the one or more dehydration points, one or more live variables from a set of variables; and

creating, by the computer system, an optimization data structure that for each dehydration point identifies the one or more live variables.

2. The method for reducing the size of the BPEL data blob for storage of claim 1, wherein at runtime, the optimization data structure is checked when the one or more dehydration points are reached such that the one or more live variables of the set of variables are stored within the BPEL data blob and one or more not-live variables of the set of variables are not stored within the BPEL data blob.

3. The method for reducing the size of the BPEL data blob for storage of claim 1, further comprising:

compiling, by the computer system, the BPEL code using a BPEL compiler configured to perform the liveness analysis, thereby creating compiled BPEL code.

4. The method for reducing the size of the BPEL data blob for storage of claim 3, the method further comprising:

executing, by the computer system, a BPEL process using the compiled BPEL code;

dehydrating, by the computer system, the BPEL process at a dehydration point during execution of the BPEL process using the compiled BPEL code; and

identifying, by the computer system, using the optimization data structure, the one or more live variables for the dehydration point.

5. The method for reducing the size of the BPEL data blob for storage of claim 4, the method further comprising:

creating, by the computer system, the BPEL data blob that comprises the one or more live variables of the set of variables, but does not comprise not-live variables of the set of variables; and

storing, by the computer system, the BPEL data blob.

6. The method for reducing the size of the BPEL data blob for storage of claim 4, wherein the BPEL data blob is smaller than if the BPEL data blob contained live and not-live variables.

7. The method for reducing the size of the BPEL data blob for storage of claim 3, wherein the optimization data structure is a file that comprises an indication of each variable that is live at each dehydration point of the compiled BPEL code.

8. The method for reducing the size of the BPEL data blob for storage of claim 3, wherein the optimization data structure is a file that comprises an indication of each variable that is live at each dehydration point of the compiled BPEL code.

9. The method for reducing the size of the BPEL data blob for storage of claim 1, wherein at least some variables of the set of variables are XML variables.

10. A computer program residing on a non-transitory processor-readable medium for reducing a size of a business-process data blob for storage, the computer program comprising computer-readable instructions configured to cause a computer to:

identify one or more dehydration points within code;

perform a liveness analysis for the one or more dehydration points;

identify at each of the one or more dehydration points, one or more live variables from a set of variables; and

create an optimization data structure that for each dehydration point identifies the one or more live variables.

11. The computer program for reducing the size of the business-process data blob of claim 10, wherein at runtime, the optimization data structure is checked when the one or more dehydration points are reached such that the one or more live variables of the set of variables are stored within the business-process data blob and one or more not-live variables of the set of variables are not stored within the business-process data blob.

12. The computer program for reducing the size of the business-process data blob of claim 10, wherein the computer program further comprises computer-readable instructions configured to cause the computer to:

compile the code using a compiler configured to perform the liveness analysis, thereby creating compiled code.

13. The computer program for reducing the size of the business-process data blob of claim 12, wherein the computer program further comprises computer-readable instructions configured to cause the computer to:

execute a process using the compiled code;

dehydrate the process at a dehydration point during execution of the process using the compiled code; and

identify, using the optimization data structure, the one or more live variables for the dehydration point.

14. The computer program for reducing the size of the business-process data blob of claim 13, wherein the computer program further comprises computer-readable instructions configured to cause the computer to:

create the business-process data blob that comprises the one or more live variables of the set of variables, but does not comprise not-live variables of the set of variables; and

store the business-process data blob.

15. The computer program for reducing the size of the business-process data blob of claim 13, wherein the business-process data blob is smaller than if the business-process data blob contained live and not-live variables.

16. The computer program for reducing the size of the business-process data blob of claim 12, wherein the optimization data structure is a file that comprises an indication of each variable that is live at each dehydration point of the compiled code.

17. The computer program for reducing the size of the business-process data blob of claim 12, wherein the optimization data structure is a file that comprises an indication of each variable that is live at each dehydration point of the compiled code.

18. The computer program for reducing the size of the business-process data blob of claim 10, wherein at least some variables of the set of variables are XML variables.

19. The computer program for reducing the size of the business-process data blob of claim 10, wherein the code is business process execution language (BPEL) code.

20. A method for optimizing a Business Process Execution Language (BPEL) code for execution, the method comprising:

compiling, by a computer system, the BPEL code using a BPEL compiler configured to perform an optimization;

identifying, by the computer system, one or more points within the BPEL code that are eligible for the optimization; and

creating, by the computer system, optimized executable BPEL code based on the BPEL code, wherein the optimized executable BPEL code based on the BPEL code has the optimization.