JDK-8014320 : Faster multiplication and division of very large integers
  • Type: Enhancement
  • Component: core-libs
  • Sub-Component: java.math
  • Priority: P4
  • Status: Open
  • Resolution: Unresolved
  • OS: generic
  • CPU: generic
  • Submitted: 2013-05-10
  • Updated: 2018-09-11
The Version table provides details related to the release that this issue/RFE will be addressed.

Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availability Release.

To download the current JDK release, click here.
Other
tbdUnresolved
Related Reports
Relates :  
JDK-8032026 - Faster division without remainder of large integers
Relates :  
JDK-8014319 - Faster division of large integers
Relates :  
JDK-4837946 - Faster multiplication and exponentiation of large integers
Relates :  
JDK-5100935 - No way to access the 64-bit integer multiplication of 64-bit CPUs efficiently
Description
Implement Barrett division (https://en.wikipedia.org/wiki/Barrett_reduction) and Schoenhage-Strassen multiplication (http://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strassen_algorithm) algorithms in BigInteger.
Comments
From core-libs: "I just wanted to point out that if JDK-5100935 were implemented, it would allow for a speed improvement of an estimated 20% for SS multiplication in the 20,000 - 80,000 digit range. There are other improvements to JDK-8014320 that could be done now, but they would only make a difference well into the 100,000s of digits." http://mail.openjdk.java.net/pipermail/core-libs-dev/2014-March/025964.html
23-03-2014
Files for review from 2014-02-06.
07-02-2014
Files submitted for review: http://mail.openjdk.java.net/pipermail/core-libs-dev/2014-February/024887.html
07-02-2014