Grégory Vanuxem
unread,Dec 27, 2022, 5:31:08 AM12/27/22Sign in to reply to author
Sign in to forward
You do not have permission to delete messages in this group
Sign in to report message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to flint...@googlegroups.com, Nemo-Devel
Hello,
Just to let you know. I was discussing yesterday the use of FLINT 2
for different operations on polynomials over different rings. And as a
matter of fact I gave a bench that I ran at the beginning of the first
COVID 19 containment (around march 2020). But I was surprised by the
regression in terms of performance.
This is with nested univariate polynomials, the R.Fateman benchmark,
if memory does not deserve me multivariate polynomial operations were
not implemented/finalized in FLINT. Here FLINT routines are called via
Nemo on top of Julia.
March 2020:
R, x = PolynomialRing(ZZ, "x");
S, y = PolynomialRing(R, "y");
T, z = PolynomialRing(S, "z");
U, t = PolynomialRing(T, "t");
f = x + y + z + t + 1
p = f^30;
@time q = p*(p+1);
20.099625 seconds (2.32 M allocations: 102.120 MiB, 0.78% gc time)
And today on the same laptop (almost the same configuration):
julia> R, x = PolynomialRing(ZZ, "x");
julia> S, y = PolynomialRing(R, "y");
julia> T, z = PolynomialRing(S, "z");
julia> U, t = PolynomialRing(T, "t");
julia> f = x + y + z + t + 1
t + z + y + x + 1
julia> p = f^30;
julia> @time q = p*(p+1);
32.071521 seconds (8.32 M allocations: 335.585 MiB, 0.96% gc time,
0.02% compilation time).
julia> @time q = p*(p+1);
31.502950 seconds (8.31 M allocations: 335.553 MiB, 1.28% gc time,
0.01% compilation time)
julia> @time q = p*(p+1);
31.069855 seconds (5.59 M allocations: 265.802 MiB, 0.23% gc time)
It could be because of Julia upgrades but I would be surprised.
Regards,
__
Greg