I'm not sure I want to bring this into the discussion, but there's a proposal
(pushed largely by Facebook) for a timescale called the "flick" which is
exactly 1/70560 second.
Quote:
"This unit of time is the smallest time unit which is LARGER than a
nanosecond, and can in integer
there has a copy. ;)
I started writing a version of that cache using Future but it got
looking a bit hairy. I submitted the very-simple version I did (which
is not the one that was in the final release) because I thought
anything more complex would hold up review too much.
--
Alan Eliasen
the thresholds to be set that high? What performance
effect do those higher thresholds have on the most common architectures?
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
, and any slowdown is a
small constant-time (because of == check instead of .equals()). It
just does the right thing automatically. Thanks, Brian!
If I could approve this patch, I would. Officially signing this
message with my cryptographic key to indicate that it's me. :)
- --
Alan Eliasen
)
{
long acc = 1;
long z = x % m;
while (y != 0)
{
if ((y 1) != 0)
acc = (acc * z) % m;
z = (z * z) % m;
y = 1;
}
return (int) acc;
}
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
of your problems:
https://www.ssllabs.com/ssltest/analyze.html?d=java.nicholaswilliams.net
As you can see, it won't work with most browsers.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
megabyte of main memory and a speed of 1
MIPS.
This is not rocket science. /oldfogey
Hehe. So could you please describe the solution?
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
controversial parts of BigInteger improvements. :)
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
of smaller numbers, but the algorithm's much-improved
efficiency will make it faster for the larger numbers that trigger it.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
the power-of-two conversions completely
with bit operations in BigInteger and not relying on Long, but the
improvement may be small as these cases are already relatively fast.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
but not so long as to take forever.
The code for the tuning program is available at:
http://futureboy.us/temp/BigIntTiming.java
Let me know what sort of thresholds you find to work best on various
architectures.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
in a day or a week. I don't want
to present myself as a genius. I'm no better than a typical
undergraduate.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
.) This behavior would probably want to be factored out into
separate private functions, as it would be useful in pow(), square(),
and potentially in division, as I was recently discussing with Tim Buktu.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
of 2 shouldn't need the recursive improvements
in BigInteger.toString.
If you let me know if these changes get checked in, I can see if
re-tuning the threshold for BigInteger.toString() can improve
performance even further.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
in MutableBigInteger.java . I can revise the patches if you
want.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
in comments will be difficult.
If you want to change the comment to something like my first sentence
in the first paragraph, that would be fine. Alternately, we could
change the logic to match the comment, but that would probably mean that
we should re-tune the thresholds.
--
Alan Eliasen
elia
.
Let me know if you have any issues with these.
Tim and Brian, you might decide amongst yourselves who wants to file
the issues for phases 3 and 4. I don't know if Brian has any magical
powers to make the issues skip the QA process.
--
Alan Eliasen
elia...@mindspring.com
http
On May 4, 2013, at 5:13 AM, Alan Eliasen wrote:
If you're feeling overwhelmed by the magnitude of the changes to
BigInteger, I would very strongly suggest that you review it in
stages. This e-mail proposes stages for the review of this patch.
On 05/06/2013 02:47 PM, Brian Burkhalter wrote
in the Karatsuba
and Toom-Cook regions, and all base conversion test. It does not test
multiplication in the Schoenhage-Strassen regions, nor does it test
large division.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
including GMP and previous
versions of BigInteger.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
Alan Eliasen wrote:
Brian, as you may also not know, I have further patches to
drastically improve the toString behavior of BigInteger using
Schoenhage-Strassen recursive decomposition. This makes toString
orders of magnitude faster for large numbers and will likely
improve
On 10/27/2009 01:12 AM, Alan Eliasen wrote:
On 10/23/2009 11:01 AM, Andrew John Hughes wrote:
6622432 is the one of the ones I just pointed to i.e. it's in JDK7.
If Alan has a further patch and hasn't even submitted it for
inclusion, it's obviously not in.
I had just queried Joe Darcy
will be able to do a web search for any content here. I
reported this months ago. It's a pretty big issue for all of these
forums because you can't search for existing solutions, discussions, etc.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
? This would appear to have major implications for the
viability of the OpenJDK project.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
the necessary fix to all
contributors on all lists, who try to contribute value to their products
for free. Please forward this to the web-discuss list.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
Java's numerics. Please keep me informed.
I've already implemented a lot of missing algorithms.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
are approved. (I was asked by Joe Darcy to
submit in smaller patches.) Hopefully these might get in JDK 7 too.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
, and are
implemented in terms of already-existing methods in BigInteger. Some
more performance might be squeezed out of them by doing more low-level
bit-fiddling, but I wanted to get a working version in and tested.
--
Alan Eliasen | Furious activity is no substitute
elia
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.
--
Alan Eliasen
elia...@mindspring.com
http://futureboy.us/
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 course
30 matches
Mail list logo
