blob: 0ae84cf993c8ccace0b68790c09d5c0f6080f0db (
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
29
30
31
32
33
34
|
+++
title = "Dynamic Scheduling with Static Scheduling"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["1c3"]
forwardlinks = ["1c3b"]
zettelid = "1c3a"
+++
Combining static and dynamic scheduling is really useful to get the best
benefits from both \[1\]. This is mainly because dynamic scheduling has
better performance when memory access patterns are strange and
unpredictable, however, static scheduling is much more efficient in
terms of performance and area when the access patterns are predictable.
<div id="refs" class="references csl-bib-body" markdown="1">
<div id="ref-cheng20_combin_dynam_static_sched_high_level_synth"
class="csl-entry" markdown="1">
<span class="csl-left-margin">\[1\]
</span><span class="csl-right-inline">J. Cheng, L. Josipovic, G. A.
Constantinides, P. Ienne, and J. Wickerson, “Combining dynamic & static
scheduling in high-level synthesis,” in *The 2020 ACM/SIGDA
international symposium on field-programmable gate arrays*, in FPGA ’20.
Seaside, CA, USA: Association for Computing Machinery, 2020, pp.
288–298. doi: [10.1145/3373087.3375297].</span>
</div>
</div>
[10.1145/3373087.3375297]: https://doi.org/10.1145/3373087.3375297
|
