On Tue, Sep 22, 2009 at 4:48 PM, Daniel Cheng
wrote:
> On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo wrote:
>> I created a new branch (bigint7) which tests the performance of java 7's
>> BigInteger implementation. can people please benchmark it?
>>
>
> no significant
On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo wrote:
> I created a new branch (bigint7) which tests the performance of java 7's
> BigInteger implementation. can people please benchmark it?
>
no significant different are found.
AMD Athlon(TM) XP 1800+
Java(TM) SE Runtime Environment (build
On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo wrote:
> I created a new branch (bigint7) which tests the performance of java 7's
> BigInteger implementation. can people please benchmark it?
>
BigInteger use java.util.Arrays.copyOfRange and friends, which are java 6 only.
On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo xl...@cam.ac.uk wrote:
I created a new branch (bigint7) which tests the performance of java 7's
BigInteger implementation. can people please benchmark it?
no significant different are found.
AMD Athlon(TM) XP 1800+
Java(TM) SE Runtime Environment
Matthew Toseland wrote:
> On Saturday 19 September 2009 03:46:27 Ximin Luo wrote:
>> http://github.com/freenet/fred-staging/commit/dea2134ba56462afb0806c5e126306bd0441c5bb
>>
>> Why is this commit necessary? The Java API documentation for
>> BigInteger.toByteArray() says "This representation is
On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo xl...@cam.ac.uk wrote:
I created a new branch (bigint7) which tests the performance of java 7's
BigInteger implementation. can people please benchmark it?
BigInteger use java.util.Arrays.copyOfRange and friends, which are java 6 only.
Matthew Toseland wrote:
On Saturday 19 September 2009 03:46:27 Ximin Luo wrote:
http://github.com/freenet/fred-staging/commit/dea2134ba56462afb0806c5e126306bd0441c5bb
Why is this commit necessary? The Java API documentation for
BigInteger.toByteArray() says This representation is compatible
On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo wrote:
> I created a new branch (bigint7) which tests the performance of java 7's
> BigInteger implementation. can people please benchmark it?
>
> On latest fred-staging:
>
> $ git checkout bigint7
> $ ant unit -Dbenchmark=true
>
> ? ?[junit]
On Saturday 19 September 2009 03:46:27 Ximin Luo wrote:
> http://github.com/freenet/fred-staging/commit/dea2134ba56462afb0806c5e126306bd0441c5bb
>
> Why is this commit necessary? The Java API documentation for
> BigInteger.toByteArray() says "This representation is compatible with the
> (byte[])
Daniel Cheng wrote:
> Native is slower then pure java here? flawed benchmark?
> Or just some very good jit?
>
>>[junit] native = 117.6909483604948% of pure java time
>>[junit] java 7 = 88.31729825250343% of pure java time
>>[junit] - ---
>>
http://github.com/freenet/fred-staging/commit/dea2134ba56462afb0806c5e126306bd0441c5bb
Why is this commit necessary? The Java API documentation for
BigInteger.toByteArray() says "This representation is compatible with the
(byte[]) constructor."
X
On Saturday 19 September 2009 00:29:09 Ximin Luo wrote:
> the BigInteger unit test is the last one run; you don't need to look through
> the huge output, just wait for it to finish and it'll be at the end.
>
> also, if someone could profile a node to see how important modPow really is
> that
the BigInteger unit test is the last one run; you don't need to look through
the huge output, just wait for it to finish and it'll be at the end.
also, if someone could profile a node to see how important modPow really is
that would be useful (i don't have time to learn how to use a profiler
I created a new branch (bigint7) which tests the performance of java 7's
BigInteger implementation. can people please benchmark it?
On latest fred-staging:
$ git checkout bigint7
$ ant unit -Dbenchmark=true
[junit] - Standard Output ---
[junit] DEBUG: Warming up
On Sat, Sep 19, 2009 at 7:26 AM, Ximin Luo xl...@cam.ac.uk wrote:
I created a new branch (bigint7) which tests the performance of java 7's
BigInteger implementation. can people please benchmark it?
On latest fred-staging:
$ git checkout bigint7
$ ant unit -Dbenchmark=true
[junit]
Daniel Cheng wrote:
Native is slower then pure java here? flawed benchmark?
Or just some very good jit?
[junit] native = 117.6909483604948% of pure java time
[junit] java 7 = 88.31729825250343% of pure java time
[junit] - ---
JNI itself
On Saturday 19 September 2009 03:46:27 Ximin Luo wrote:
http://github.com/freenet/fred-staging/commit/dea2134ba56462afb0806c5e126306bd0441c5bb
Why is this commit necessary? The Java API documentation for
BigInteger.toByteArray() says This representation is compatible with the
(byte[])
I created a new branch (bigint7) which tests the performance of java 7's
BigInteger implementation. can people please benchmark it?
On latest fred-staging:
$ git checkout bigint7
$ ant unit -Dbenchmark=true
[junit] - Standard Output ---
[junit] DEBUG: Warming up
the BigInteger unit test is the last one run; you don't need to look through
the huge output, just wait for it to finish and it'll be at the end.
also, if someone could profile a node to see how important modPow really is
that would be useful (i don't have time to learn how to use a profiler
On Saturday 19 September 2009 00:29:09 Ximin Luo wrote:
the BigInteger unit test is the last one run; you don't need to look through
the huge output, just wait for it to finish and it'll be at the end.
also, if someone could profile a node to see how important modPow really is
that would be
http://github.com/freenet/fred-staging/commit/dea2134ba56462afb0806c5e126306bd0441c5bb
Why is this commit necessary? The Java API documentation for
BigInteger.toByteArray() says This representation is compatible with the
(byte[]) constructor.
X
___
21 matches
Mail list logo