diff options
Diffstat (limited to 'content/zettel/1c2e.md')
| -rw-r--r-- | content/zettel/1c2e.md | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/content/zettel/1c2e.md b/content/zettel/1c2e.md new file mode 100644 index 0000000..10c178b --- /dev/null +++ b/content/zettel/1c2e.md @@ -0,0 +1,28 @@ ++++ +title = "Iterative Modulo Scheduling" +author = "Yann Herklotz" +tags = [] +categories = [] +backlinks = ["1c2g", "1c2d"] +forwardlinks = ["1c2f"] +zettelid = "1c2e" ++++ + +Iterative modulo scheduling \[1\] is an algorithm that can be used to +schedule loops as optimally as possible, without being intractable. The +other problem that is faced is that the loop bounds are often only known +at run time. This means that the loop cannot be completely unrolled + +<div id="refs" class="references csl-bib-body" markdown="1"> + +<div id="ref-rau96_iterat_modul_sched" class="csl-entry" markdown="1"> + +<span class="csl-left-margin">\[1\] +</span><span class="csl-right-inline">B. R. Rau, “Iterative modulo +scheduling,” *International Journal of Parallel Programming*, vol. 24, +no. 1, pp. 3–64, Feb. 1996, Available: +<https://doi.org/10.1007/BF03356742></span> + +</div> + +</div> |