blob: 23e81287d691d1d524697040fd46e369d2f9ee5d (
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
35
36
|
+++
title = "Lightweight speculation and predication in HLS"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["2b1c"]
forwardlinks = []
zettelid = "2b1c1"
+++
In high-level synthesis, there is no penalty for performing jumps, and
one can therefore implement a lightweight predicated execution, where
less predication is used (only in writes) and jumps are used in the
shorted branches \[1\].
This is done by adding a jump statement in the shorter branch which
jumps to the end of the if-statement, therefore allowing predication to
work as efficiently as jumps. This is more efficient for high-level
synthesis, as there is no cost when jumping.
<div id="refs" class="references csl-bib-body" markdown="1">
<div id="ref-nane12" class="csl-entry" markdown="1">
<span class="csl-left-margin">\[1\]
</span><span class="csl-right-inline">R. Nane, V. Sima, and K. Bertels,
“A lightweight speculative and predicative scheme for hardware
execution,” in *2012 international conference on reconfigurable
computing and FPGAs*, Dec. 2012, pp. 1–6. doi:
[10.1109/ReConFig.2012.6416721].</span>
</div>
</div>
[10.1109/ReConFig.2012.6416721]: https://doi.org/10.1109/ReConFig.2012.6416721
|
