Displaying 20 results from an estimated 25 matches for "five11".
2015 May 27
2
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
Update: in that same block of 10,000 LLVM/Clang revisions, this the number
of distinct SHA1 hashes for the binaries of the following benchmarks:
7 MultiSource/Applications/aha/aha
2 MultiSource/Benchmarks/BitBench/drop3/drop3
10 MultiSource/Benchmarks/BitBench/five11/five11
7 MultiSource/Benchmarks/BitBench/uudecode/uudecode
3 MultiSource/Benchmarks/BitBench/uuencode/uuencode
5 MultiSource/Benchmarks/Trimaran/enc-rc4/rc4
11 SingleSource/Benchmarks/BenchmarkGame/n-body
2 SingleSource/Benchmarks/Shootout/ackermann
Let me know if there are any specific benchmarks...
2015 May 27
0
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...wrote:
>
> Update: in that same block of 10,000 LLVM/Clang revisions, this the number of distinct SHA1 hashes for the binaries of the following benchmarks:
>
> 7 MultiSource/Applications/aha/aha
> 2 MultiSource/Benchmarks/BitBench/drop3/drop3
> 10 MultiSource/Benchmarks/BitBench/five11/five11
> 7 MultiSource/Benchmarks/BitBench/uudecode/uudecode
> 3 MultiSource/Benchmarks/BitBench/uuencode/uuencode
> 5 MultiSource/Benchmarks/Trimaran/enc-rc4/rc4
> 11 SingleSource/Benchmarks/BenchmarkGame/n-body
> 2 SingleSource/Benchmarks/Shootout/ackermann
>
> Let me know i...
2015 May 21
4
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com> wrote:
> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change. So if
> just store a hash of the binary in the database, we should be able to pool
> all samples we have collected while the binary is the the same as it
> currently is, which will let us use significantly more datapoints for the
> reference.
+1
> Also, we can trivially...
2015 May 19
5
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
The reruns flag already does that. It helps a bit, but only as long as the the benchmark is flagged as regressed.
> On May 18, 2015, at 8:28 PM, Sean Silva <chisophugis at gmail.com> wrote:
>
>
>
> On Mon, May 18, 2015 at 11:24 AM, Mikhail Zolotukhin <mzolotukhin at apple.com <mailto:mzolotukhin at apple.com>> wrote:
> Hi Chris and others!
>
> I
2015 May 21
3
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...olin <renato.golin at linaro.org>
> wrote:
> >
> > On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com> wrote:
> >> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
> >> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change.
> So if
> >> just store a hash of the binary in the database, we should be able to
> pool
> >> all samples we have collected while the binary is the the same as it
> >> currently is, which will let us use significantly more datapoints for
> the
> &g...
2015 May 26
0
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...lin at linaro.org>> wrote:
>
> On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com<mailto:chisophugis at gmail.com>> wrote:
>> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
>> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change. So if
>> just store a hash of the binary in the database, we should be able to pool
>> all samples we have collected while the binary is the the same as it
>> currently is, which will let us use significantly more datapoints for the
>> reference.
>
> +1
>...
2015 May 28
2
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...> On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com
> <mailto:chisophugis at gmail.com>> wrote:
> >> In the last 10,000 revisions of LLVM+Clang, only 10 revisions
> actually
> >> caused the binary of MultiSource/Benchmarks/BitBench/five11 to
> change. So if
> >> just store a hash of the binary in the database, we should be
> able to pool
> >> all samples we have collected while the binary is the the same
> as it
> >> currently is, which will let us use significantly more
&g...
2015 Jul 07
4
[LLVMdev] Recording hash of binaries in test-suite and LNT.
...olin <renato.golin at linaro.org>
> wrote:
> >
> > On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com> wrote:
> >> In the last 10,000 revisions of LLVM+Clang, only 10 revisions
> >> actually caused the binary of MultiSource/Benchmarks/BitBench/five11
> >> to change. So if just store a hash of the binary in the database, we
> >> should be able to pool all samples we have collected while the binary
> >> is the the same as it currently is, which will let us use
> >> significantly more datapoints for the referenc...
2015 May 28
2
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...lin at linaro.org>> wrote:
>
> On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com<mailto:chisophugis at gmail.com>> wrote:
>> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
>> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change. So if
>> just store a hash of the binary in the database, we should be able to pool
>> all samples we have collected while the binary is the the same as it
>> currently is, which will let us use significantly more datapoints for the
>> reference.
>
> +1
>...
2015 May 28
0
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...> >
>> > On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com <mailto:chisophugis at gmail.com>> wrote:
>> >> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
>> >> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change. So if
>> >> just store a hash of the binary in the database, we should be able to pool
>> >> all samples we have collected while the binary is the the same as it
>> >> currently is, which will let us use significantly more datapoints for the
>> &...
2015 Jun 02
3
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...> wrote:
> >
> > On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com <mailto:chisophugis at gmail.com>> wrote:
> >> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
> >> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change. So if
> >> just store a hash of the binary in the database, we should be able to pool
> >> all samples we have collected while the binary is the the same as it
> >> currently is, which will let us use significantly more datapoints for the
> >> referenc...
2015 May 28
1
[LLVMdev] Proposal: change LNT’s regression detection algorithm and how it is used to reduce false positives
...> wrote:
> >
> > On 20 May 2015 at 23:31, Sean Silva <chisophugis at gmail.com <mailto:chisophugis at gmail.com>> wrote:
> >> In the last 10,000 revisions of LLVM+Clang, only 10 revisions actually
> >> caused the binary of MultiSource/Benchmarks/BitBench/five11 to change. So if
> >> just store a hash of the binary in the database, we should be able to pool
> >> all samples we have collected while the binary is the the same as it
> >> currently is, which will let us use significantly more datapoints for the
> >> referenc...
2015 Feb 26
5
[LLVMdev] [RFC] AArch64: Should we disable GlobalMerge?
Hi all,
I've started looking at the GlobalMerge pass, enabled by default on
ARM and AArch64. I think we should reconsider that, at least for
AArch64.
As is, the pass just merges all globals together, in groups of 4KB
(AArch64, 128B on ARM).
At the time it was enabled, the general thinking was "it's almost
free, it doesn't affect performance much, we might as well use it".
2012 Feb 19
2
[LLVMdev] Problem While Running Test Suite
...rce/Benchmarks/VersaBench/beamformer/beamformer | * | * |
MultiSource/Benchmarks/VersaBench/dbms/dbms | * | * |
MultiSource/Benchmarks/VersaBench/8b10b/8b10b | * | * |
MultiSource/Benchmarks/BitBench/five11/five11 | * | * |
MultiSource/Benchmarks/BitBench/drop3/drop3 | * | * |
MultiSource/Benchmarks/BitBench/uuencode/uuencode | * | * |
MultiSource/Benchmarks/BitBench/uudecode/uudecode...
2013 Jul 28
0
[LLVMdev] IR Passes and TargetTransformInfo: Straw Man
...0.08708175637204
Benchmarks/Olden/em3d/em3d 2.0241 2.0262 0.10374981473247
Benchmarks/TSVC/LoopRerolling-flt/LoopRerol 2.0889 2.0914 0.11968021446694
Benchmarks/TSVC/Packing-dbl/Packing-dbl 2.8154 2.8196 0.14917951268025
Benchmarks/BitBench/five11/five11 4.038 4.0448 0.16840019811788
Benchmarks/Olden/treeadd/treeadd 0.1588 0.1591 0.18891687657430
Benchmarks/TSVC/IndirectAddressing-flt/Indi 2.1573 2.1615 0.19468780419969
Benchmarks/Ptrdist/anagram/anagram 0.6629 0.6644...
2013 Jul 18
3
[LLVMdev] IR Passes and TargetTransformInfo: Straw Man
Andy and I briefly discussed this the other day, we have not yet got
chance to list a detailed pass order
for the pre- and post- IPO scalar optimizations.
This is wish-list in our mind:
pre-IPO: based on the ordering he propose, get rid of the inlining (or
just inline tiny func), get rid of
all loop xforms...
post-IPO: get rid of inlining, or maybe we still need it, only
2018 Apr 26
0
Compare test-suite benchmarks performance complied without TBAA, with default TBAA and with new TBAA struct path
...0|2.208563573| 0.16| 8974289110| 0| 2.20958891| 0.11| 8974289109| 0|
|MultiSource/Benchmarks/BitBench/drop3/drop3.test | 169|0.165502473| 1989074268|0.165868692| -0.22| 1989074282| 0|0.166100023| -0.36| 1989074282| 0|
|MultiSource/Benchmarks/BitBench/five11/five11.test | 40|1.108902765|11578404923|1.108417771| 0.04|11578404923| 0|1.109621078| -0.06|11578404923| 0|
|MultiSource/Benchmarks/BitBench/uudecode/uudecode.test | 325|0.051157985| 739996870|0.051196828| -0.08| 739996866| 0|0....
2009 Oct 20
1
[LLVMdev] 2.6 pre-release2 ready for testing
...0.04 | - - n/a n/a
> MultiSource/Benchmarks/BitBench/drop3/drop3 |
> 0.0200 3592 0.0199 * 0.0200 | 0.48 0.66
> 0.46 * 0.49 | 0.73 1.04 n/a n/a
> MultiSource/Benchmarks/BitBench/five11/five11 |
> 0.0000 2768 0.0100 * 0.0100 | 2.33 2.44
> 2.27 * 2.39 | 0.95 1.03 n/a n/a
> MultiSource/Benchmarks/BitBench/uudecode/uudecode |
> 0.0200 2968 0.0100 * ...
2009 Oct 20
0
[LLVMdev] 2.6 pre-release2 ready for testing
Hi Tanya,
> 1) Compile llvm from source and untar the llvm-test in the projects
> directory (name it llvm-test or test-suite). Choose to use a
> pre-compiled llvm-gcc or re-compile it yourself.
I compiled llvm and llvm-gcc with separate objects directories.
Platform is x86_64-linux-gnu.
> 2) Run make check, report any failures (FAIL or unexpected pass). Note
> that you need to
2009 Oct 20
1
[LLVMdev] 2.6 pre-release2 ready for testing
...- n/a n/a
> MultiSource/Benchmarks/BitBench/drop3/
> drop3 | 0.0200 3592 0.0199
> * 0.0200 | 0.48 0.66 0.46 *
> 0.49 | 0.73 1.04 n/a n/a
> MultiSource/Benchmarks/BitBench/five11/
> five11 | 0.0000 2768 0.0100
> * 0.0100 | 2.33 2.44 2.27 *
> 2.39 | 0.95 1.03 n/a n/a
> MultiSource/Benchmarks/BitBench/uudecode/
> uudecode | 0.0200 2968 0.01...