Loop perforation 📖 Wikipedia

Loop perforation is an approximate computing technique that allows to regularly skip some iterations of a loop.^[1][2][3]

It relies on one parameter: the perforation rate. The perforation rate can be interpreted as the number of iteration to skip each time or the number of iterations to perform before skipping one.

Variants of loop perforation include those that skip iterations deterministically at regular intervals, those that skip iterations at the beginning or the end of the loop, and those that skip a random sample of iterations. The compiler may select the perforation variant at the compile-time, or include instrumentation that allows the runtime system to adaptively adjust the perforation strategy and perforation rate to satisfy the end-to-end accuracy goal.

Loop perforation techniques were first developed by MIT professor Martin C. Rinard and researchers in his group, Henry Hoffmann, Sasa Misailovic, and Stelios Sidiroglou.

The examples that follows provide the result of loop perforation applied on this C-like source code

for (int i = 0; i < N; i++) {
    // do things
}

for (int i = 0; i < N; i++) {
    // do things
    i = i + skip_factor;
}

int count = 0;

for (int i = 0; i < N; i++) {
    if (count == skip_factor) {
        count = 0;
    } else {
        // do things
        count++;
    }
}

• Approximate computing
• Task skipping
• Memoization

This computing article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e