Note on Stride:
Memory stride is the distance between memory accesses and is measured as:
Local stride: This is the memory stride between two memory accesses for the same memory reference.
Global stride: This is the memory stride between memory accesses for consecutive memory references.
Consider the following example:
for (i=0; i<1000; i++){ for(j=0; j<10; j++){ sum += arrayOne[i] + arrayTwo[j]; } result[i] = sum; }The memory stride between consecutive memory accesses for the arrayOne memory reference is its local stride, i.e. (starting address of arrayOne[50] - ending address of arrayOne[49] ) is the local stride of arrayOne.
Note: This also means that if a region of code contains only 1 memory reference, global stride will be the same as local stride.
gStride60:
gStride60 or global stride 1 is a measure of the number of consecutive memory references that access memory locations that are < 60 Bytes apart.
Classifying gStride60:
gStride60 can be classified as low, medium or high as follows:
Bucket | Condition |
---|---|
Low |
The region of code contains no memory references.
OR
None of the unique memory references access the same array.OR
The region of code contains a number of memory references and those that have a
global stride <60 are outnumbered by 3:1.
|
Medium | The region of code contains a number of memory references and the references that have a global stride of < 60 are outnumbered by about 2:1. |
High |
The region of code contains a number of memory references and the references that have a global stride of < 60 outnumber the other references by 3:2 or more.
OR
Any of the other global stride feature values are high.
|
Example:
Consider the following code:
for (i=0; i<1000; i++){ for(j=0; j<10; j++){ sum += arrayOne[i] * arrayTwo[j]; } result[i] = sum; }This code contains 3 memory references (through arrays arrayOne, arrayTwo & result) and there are at least (8*1000) 8kB between arrayOne and arrayTwo.