bpf: improve the general precision of tnum_mul #5758
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Author
|
Upstream branch: dc0fe95 |
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
bpf-next_base
branch
from
91606c1 to
9e5d665
Compare
Author
|
Upstream branch: c80d797 |
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
series/991951=>bpf-next
branch
from
efd6713 to
e7d6e2c
Compare
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
bpf-next_base
branch
from
9e5d665 to
f86fd37
Compare
Author
|
Upstream branch: abdaf49 |
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
series/991951=>bpf-next
branch
from
e7d6e2c to
980667b
Compare
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
bpf-next_base
branch
from
f86fd37 to
2842450
Compare
Author
|
Upstream branch: 3ec8560 |
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
series/991951=>bpf-next
branch
from
980667b to
e15bad2
Compare
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
bpf-next_base
branch
from
2842450 to
53b8665
Compare
Author
|
Upstream branch: 1274163 |
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
series/991951=>bpf-next
branch
from
e15bad2 to
685377b
Compare
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
bpf-next_base
branch
from
53b8665 to
26f4a08
Compare
This commit addresses a challenge explained in an open question ("How
can we incorporate correlation in unknown bits across partial
products?") left by Harishankar et al. in their paper:
https://arxiv.org/abs/2105.05398
When LSB(a) is uncertain, we know for sure that it is either 0 or 1,
from which we could find two possible partial products and take a
union. Experiment shows that applying this technique in long
multiplication improves the precision in a significant number of cases
(at the cost of losing precision in a relatively lower number of
cases).
This commit also removes the value-mask decomposition technique
employed by Harishankar et al., as its direct incorporation did not
result in any improvements for the new algorithm.
Signed-off-by: Nandakumar Edamana <[email protected]>
Author
|
Upstream branch: d87fdb1 |
kernel-patches-daemon-bpf-rc
bot
force-pushed
the
series/991951=>bpf-next
branch
from
685377b to
6970f56
Compare
Author
|
At least one diff in series https://patchwork.kernel.org/project/netdevbpf/list/?series=991951 expired. Closing PR. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Pull request for series with
subject: bpf: improve the general precision of tnum_mul
version: 2
url: https://patchwork.kernel.org/project/netdevbpf/list/?series=991951