diff options
| author | Yann Herklotz <git@yannherklotz.com> | 2022-06-27 15:01:51 +0100 |
|---|---|---|
| committer | Yann Herklotz <git@yannherklotz.com> | 2022-06-27 15:01:51 +0100 |
| commit | 2fa27381a18e65b4af2d860dc9be17489ff26258 (patch) | |
| tree | 558ce90874835ff0094af1abf56256b346402ffc /chapters/schedule.tex | |
| parent | b93723f5d4391333b6ed12cea8c3f49871976927 (diff) | |
| download | lsr22_fvhls-2fa27381a18e65b4af2d860dc9be17489ff26258.tar.gz lsr22_fvhls-2fa27381a18e65b4af2d860dc9be17489ff26258.zip | |
Add changes
Diffstat (limited to 'chapters/schedule.tex')
| -rw-r--r-- | chapters/schedule.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/chapters/schedule.tex b/chapters/schedule.tex index 73cb4b2..52b93d0 100644 --- a/chapters/schedule.tex +++ b/chapters/schedule.tex @@ -26,7 +26,7 @@ hyperblock scheduling, and is described in \in{Chapter}[sec:scheduling]. Curren need to be completed, as well as submitting a paper about the work to FMCAD/POPL/PLDI. In general, this work was supposed to be finished in November 2021, however, due to complications with the actual formulation of the semantics, as well as the number of proofs that need to be completed, the -work is still on going. +work is still ongoing. \desc{Modulo scheduling} The second piece of work is described in \in{Chapter}[sec:pipelining] and describes the implementation of modulo scheduling to perform scheduling on loops. This work will be @@ -92,7 +92,7 @@ proving hyperblock scheduling. This requires proofs of the following translatio proof as well as simplify the scheduling algorithm. \desc{\sc IfConv} The {\sc IfConv} transformation introduces predicate instructions by conversing -conditional statements. This is necessary to generates hyperblocks and therefore improve the +conditional statements. This is necessary to generate hyperblocks and therefore improve the schedule by passing larger blocks to the scheduler. \desc{\sc RTLBlock $\rightarrow$ RTLPar} The proof of the scheduling algorithm itself, which is |