Loop perforation

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Loop perforation is an approximate computing technique that allows to regularly skip some iterations of a loop. 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.

Loop perforation is an approximate computing technique that allows to regularly skip some iterations of a loop. 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.

Code examples

The examples that follows provide the result of loop perforation applied on this C-like source code for (int i = 0; i

Skip n iterations each time

for (int i = 0; i

Skip one iteration after n

int count = 0; for (int i = 0; i

See also

Approximate computing Task skipping Memoization

Text derived from https://en.wikipedia.org/w/index.php?oldid=1353928148 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001353928148 · captured 1778644948.0 · version history

Cite this page as: encyclopegia.org, “Loop perforation”, snapshot enwiki-001353928148. https://encyclopegia.org/a/loop-perforation

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.