#11957: libSingular slower than Singular-via-pexpect
-----------------------------------+----------------------------------------
Reporter: SimonKing | Owner: malb
Type: defect | Status: new
Priority: major | Milestone: sage-4.7.3
Component: commutative algebra | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
-----------------------------------+----------------------------------------
Basic arithmetic in `libSingular` seems to be slower than in Singular
(used via pexpect):
{{{
sage: P.<x,y,z> = QQ[]
sage: def test1(x,y,z):
....: for i in range(100):
....: p = (x+y+z)^i
....:
sage: def test2(x,y,z):
....: x = singular(x)
....: y = singular(y)
....: z = singular(z)
....: for i in range(100):
....: p = (x+y+z)^i
....:
sage: %time test1(x,y,z)
CPU times: user 2.66 s, sys: 0.00 s, total: 2.66 s
Wall time: 2.67 s
sage: %time test2(x,y,z)
CPU times: user 0.15 s, sys: 0.08 s, total: 0.23 s
Wall time: 1.94 s
}}}
These timings were with sage-4.6.2, but they are similar with
sage-4.7.2.alpha_whatever. [http://groups.google.com/group/sage-
devel/browse_thread/thread/aa8962c1dae5432d Martin] confirms these
timings, and finds that similar things also occur with multiplication.
Citing Martin:
{{{
However, mod p it seems libSingular wins. Hence my guess:
we are using different memory allocation functions for GMP
and these functions might be slower (for Singular's use case)?
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11957>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
