blob: 10c178b125c824443677f8c6cd9391cdc213c0a6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
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>
|
