Processing

Please wait...

Settings

Settings

1. WO2009120060 - NOVEL PREDICTION TECHNIQUES

Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

Claims

1. A method for handling the complexities of nested loops and conditional statements in estimating programs' or jobs' execution time comprising of

partitioning said nested loops and conditional statements into a plurality of blocks;

identifying relationships between said each block;

grouping said each block accordingly;

computing said execution time of an innermost loop of each grouped block by taking into account the number of iterations for said nested loops or probability of a branch execution for said conditional statements;

computing said execution time of a parent loop of said innermost loop of said each grouped block;

repeating said execution time until said execution time reaches an outermost loop of said each grouped block; and

computing a sum of each said execution time of each said outermost loop of said each grouped block. °

2. The method as claimed in Claim 1 , wherein said blocks having a start line and an end line.

3. The method as claimed in Claim 1, wherein said each execution time is computed for a plurality operators and operands in each loop of said nested loops.

4. The method as claimed in Claim 1 , wherein a total execution time of each loop of said nested loops of said execution time of said each grouped block.

5. The method as claimed in Claim 1, wherein a formula is derived from said method is based on the following equation


where N is a total number of iterations in the program

ri| is a number of iterations in loop i,

Δl is a number of lines between the beginning of loop I and successive loop

P (t|) is amount to time needed to execute the innermost loop and

is an innermost loop.