* Alan Eliasen:
> Florian Weimer wrote:
>> To provide some more background, most of us probably worry about
>> BigInteger performance in the 512 to 2048 bit range because that's the
>> range used for RSA cryptography (assuming that Java uses the Chinese
>> Reminder Theorem optimization for private
* Alan Eliasen:
> Alan Eliasen wrote:
>>Note that my optimizations for the pow() function give vastly better
>> performance at even small bit sizes for many operands, as they factor
>> out powers of 2 in the exponent and perform these very rapidly as
>> bit-shifts.
>
>Oops. I mean powers
Alan Eliasen wrote:
> Andrew Haley wrote:
>> You give examples of the speedup for very large bignums, but you
>> don't say the size of numbers at which your approach becomes faster
>> than the current code. Of course any asymptotic improvement helps
>> with numbers that are half a million decimal
Alan Eliasen wrote:
>Note that my optimizations for the pow() function give vastly better
> performance at even small bit sizes for many operands, as they factor
> out powers of 2 in the exponent and perform these very rapidly as
> bit-shifts.
Oops. I mean powers of 2 in the *base*, of cou
Andrew Haley wrote:
> You give examples of the speedup for very large bignums, but you don't say
> the size of numbers at which your approach becomes faster than the current
> code. Of course any asymptotic improvement helps with numbers that are
> half a million decimal digits long, but where's t
Alan Eliasen wrote:
>From the queries I get, this is important to a lot of people. The
> performance of BigInteger can be improved by tens or hundreds or
> thousands of times (or even more in the case of certain arguments of
> pow()), and should be done to make Java a more viable platform for
16 months ago, I posted the first of several patches to vastly
improve the performance of the BigInteger class. These included
implementation of Karatsuba and 3-way Toom-Cook multiplication and
Karatsuba and Toom-Cook squaring. The particular algorithm used for
multiplication or squaring is c
Alan Eliasen wrote:
[snip]
Since I haven't heard of any progress on including my previous patch,
Sorry, still saturated with OpenJDK 6,
-Joe
A few weeks ago, I posted some performance numbers for the
improvements I'm making to the BigInteger class. Those performance
numbers were for the Karatsuba multiplication algorithm that I
implemented. I've now implemented 3-way Toom-Cook multiplication (and
Toom-Cook squaring) which has bett
Alan Eliasen wrote:
Joseph D. Darcy wrote:
Yes, this is the right group :-) As "Java Floating-Point Czar" I also
look after BigInteger, although I haven't had much time for proactive
maintenance there in a while. I think using faster, more mathematically
sophisticated algorithms in BigInteg
Joseph D. Darcy wrote:
> Yes, this is the right group :-) As "Java Floating-Point Czar" I also
> look after BigInteger, although I haven't had much time for proactive
> maintenance there in a while. I think using faster, more mathematically
> sophisticated algorithms in BigInteger for large value
Hello.
Yes, this is the right group :-) As "Java Floating-Point Czar" I also
look after BigInteger, although I haven't had much time for proactive
maintenance there in a while. I think using faster, more mathematically
sophisticated algorithms in BigInteger for large values would be a fine
I'm planning on tackling the performance issues in the BigInteger
class. In short, inefficient algorithms are used for
multiplication, exponentiation, conversion to strings, etc. I intend to
improve this by adding algorithms with better asymptotic behavior that
will work better for large numb
13 matches
Mail list logo
