Displaying 5 results from an estimated 5 matches for "trisolv".
Did you mean:
resolv
2016 Oct 12
4
[test-suite] making polybench/symm succeed with "-Ofast" and "-ffp-contract=on"
...we do not calculate nan values, which are
linear-algebra/kernels/cholesky/cholesky.c: LLVM: This change
ensures we do not calculate nan values, which are
linear-algebra/kernels/cholesky/cholesky.c: LLVM: This change
ensures we do not calculate nan values, which are
linear-algebra/kernels/trisolv/trisolv.c: LLVM: This change ensures
we do not calculate nan values, which are
linear-algebra/solvers/gramschmidt/gramschmidt.c: LLVM: This change
ensures we do not calculate nan values, which are
linear-algebra/solvers/lu/lu.c: LLVM: This change ensures we do not
calculate nan values, which are
2016 Oct 12
3
[test-suite] making polybench/symm succeed with "-Ofast" and "-ffp-contract=on"
----- Original Message -----
> From: "Renato Golin" <renato.golin at linaro.org>
> To: "Sebastian Pop" <sebpop.llvm at gmail.com>
> Cc: "Hal Finkel" <hfinkel at anl.gov>, "Sebastian Paul Pop" <s.pop at samsung.com>, "llvm-dev" <llvm-dev at lists.llvm.org>,
> "Matthias Braun" <matze at
2018 Apr 26
0
Compare test-suite benchmarks performance complied without TBAA, with default TBAA and with new TBAA struct path
...0923166| 0|3.703755898| 0.1|28020923169| 0|
|SingleSource/Benchmarks/Polybench/linear-algebra/kernels/syrk/syrk.test | 40|1.709082542|14059124595|1.711252681| -0.13|14059124600| 0|1.711381977| -0.13|14059124601| 0|
|SingleSource/Benchmarks/Polybench/linear-algebra/kernels/trisolv/trisolv.test | 225|0.103904759| 216435815|0.104026252| -0.12| 216435811| 0|0.104078778| -0.17| 216435811| 0|
|SingleSource/Benchmarks/Polybench/linear-algebra/kernels/trmm/trmm.test | 39|0.918241363| 7071633999|0.921063844| -0.31| 7071634004| 0|0.921306267| -0.33| 70716340...
2014 Jan 28
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi Stepan,
Sorry for the delay. It's great that you are working on MergeFunctions
as well and I agree, we should definitely try to combine our efforts to
improve MergeFunctions.
Just to give you some context, the pass (with the similar function
merging patch) is already being used in a production setting. From my
point of view, it would be better if we focus on improving its
capability
2014 Jan 30
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...ll 9 27788 0 0.01 27767 0 0.01 27767
tree.ll 29 75173 0 0.02 75143 0 0.01 75143
Treesort.ll 8 20035 0 0.01 20016 0 0.01 20016
Triang.ll 4 30696 0 0.01 30674 0 0.01 30674
trie.ll 12 33266 0 0.01 33243 0 0.01 33243
trig.ll 9 38056 0 0.01 38033 0 0.01 38242
trim.ll 7 106745 0 0.02 106729 0 0.02 106729
trisolv.ll 12 21126 0 0.01 21075 0 0.01 21075
trmm.ll 12 21556 0 0.01 21508 0 0.01 21508
tsc.ll 16 903509 0 0.08 903481 0 0.09 903481
ts.ll 7 10154 0 0.01 10125 0 0.01 10125
tsp.ll 6 47043 0 0.01 47024 0 0.01 47024
tt.ll 8 20968 0 0.01 20939 0 0.01 20939
tu.ll 8 54279 0 0.02 54250 0 0.02 54250
tv.ll 4 3382...