Nightly is 5.5x (Was:12x) slower on a js demo at https://manueldois.github.io/Random-tests/Array%20hashing/dist/index.html with BigInt
Categories
(Core :: JavaScript Engine, task, P3)
Tracking
()
People
(Reporter: mayankleoboy1, Unassigned)
References
(Blocks 1 open bug, )
Details
Go to https://manueldois.github.io/Random-tests/Array%20hashing/dist/index.html
Click on "run test with array with 200000 tuples"
Chrome: https://share.firefox.dev/4jaEANF (1.3s)
Nightly: https://share.firefox.dev/3W27fKB (15s)
| Reporter | ||
Updated•1 year ago
|
Comment 1•1 year ago
|
||
This is basically spending all of its time under JS::BigInt::mul...
Comment 2•1 year ago
|
||
The patch from bug 1940058 should help a bit. Further improvements need more advanced integer multiplication algorithms (Karatsuba, Schönhage–Strassen, etc.) than the simple O(n^2) algorithm we currently use. FWIW the largest BigInt in this benchmark has 9105 BigInt digits (on 64-bit).
Updated•1 year ago
|
| Reporter | ||
Comment 3•1 year ago
|
||
Latest profile:https://share.firefox.dev/3PuxCFp (7.5s)
So we get 50% improvement from bug 1940058 (same as what anba tested earlier)
| Reporter | ||
Comment 4•7 months ago
|
||
Nightly: https://share.firefox.dev/45ZgDCP (7.3s)
Chrome: https://share.firefox.dev/4p38bew (1.3s)
Description
•