Note on dependency depth: Dependency depth is defined as the number of dependent instructions that need to execute sequentially.
Consider this example:

for (i=0; i<1000; i++)
   result[i] = sqrtf(arrayOne[i]) + sqrtf(arrayTwo[i]);

1. Compute the address of arrayOne[i].
2. Load arrayOne[i].
3. Compute sqrtf(arrayOne[i]).
4. Add sqrtf(arrayOne[i]) to sqrtf(arrayTwo[i]).
5. Store the result at result[i].

ilp₃₂
This feature is a measure of the Instruction Level Parallelism available in a region of code. ilp₃₂ looks at the number of independent iterations of a loop that fit in a window of 32 instructions.

Classifying ilp₃₂:
ilp₃₂ can be classified into low, medium or high as follows: For a loop with < 32 instructions in each iteration,

Bucket	Condition
Low	The number of operations in each iteration of the loop is <6 OR The dependency depth is more than 10.
Medium	The number of operations in each iteration of the outermost loop is >=6 & <=10 & the dependency depth is about 5. OR The dependency depth is between 5 & 10.
High	The number of operations in each iteration of the outermost loop is >10 & the dependency depth is about 5.

Example 1:
Consider the following code:

for (i=0; i<1000; i++)
   result[i] = sqrtf(arrayOne[i]) + sqrtf(arrayTwo[i]);

1. Adding the offset i to the base address of arrayOne.
2. Loading the data from the address.
3. computing the square root.
4. Adding the result to sqrtf(arrayTwo[i]).
5. Storing the result at result[i].

Example 2:
Consider another example:

for (i=0; i<1000; i++){
    for (j=0; j<50; j++){
        var1 += arrayOne[i]*smallArray[j];
    }
    result[i] = var1;
}