Good afternoon,
BigInteger was changed in Java 8 to have faster multiply algorithms for
large numbers (in the thousands of bits). Since the algorithm uses
recursive decomposition (Toom Cook 3) it is fairly easy to parallelize.
I would like to propose that we add a parallelMultiply() method to
BigInteger. The speedup for very large numbers is impressive, obviously
depending on hardware.
I have created a PR https://github.com/openjdk/jdk/pull/6391 and
submitted a request for enhancement
http://bugs.java.com/bugdatabase/view_bug.do?bug_id=JDK-8277175
I would be very grateful for your ideas about this idea.
Regards
Heinz
--
Dr Heinz M. Kabutz (PhD CompSci)
Author of "The Java™ Specialists' Newsletter" - www.javaspecialists.eu
Java Champion - www.javachampions.org
JavaOne Rock Star Speaker
Tel: +30 69 75 595 262
Skype: kabutz
