If one runs the doctests on a slow computer, increasing SAGE_TIME or
SAGE_TIMEOUT_LONG will *normally* stop failures. I have to do this on
my old Sun Blade 1000 (dual 900 MHz processors).
However, there is one test
sage -t -long devel/sage/sage/schemes/elliptic_curves/BSD.py
which will always fail, and there seems little I can do about it,
since I suspect the code changes algorithm (from Heegner index
computation to heegner_index_bound) after some fixed time.
If I've mis-understood this, please correct me!
It suspect the time is independent of the processor speed or settings
of SAGE_TIMOUT or SAGE_TIMEOUT_LONG.
Could the doctest be changed in some way to stop this happening? It's
failing in 133 seconds, so I'm guessing there is something to try the
first algorithm for just over two minutes before switching to another
algorithm.
I don't know how long this takes on 't2', but ideally the test should
be able to pass on that.
Perhaps the algorithm could look at the value of SAGE_TIMEOUT if set,
and run for some multiple of that. People would only set that on older/
slower computers.
It looks as though I have not got all the output below, as I don't see
the "Expected" bit. I'm cutting/pasting from a previous email and
don't have the computer switched on which has the actual test data.
But I think you can get what I mean.
It would seem sensible that the time spent on an algorithm would be a
function of the computer speed.
(BTW, since Heegner is a person, the heegner_index_bound should start
with a capital H, so if someone changes the doctest, perhaps correct
that too).
Dave
sage -t -long devel/sage/sage/graphs/base/graph_backends.py
[9.8 s]
/
ord_p(#Sha_an) = 2
Remaining primes:
p = 3: irreducible, surjective, non-split multiplicative
(0 <= ord_p <= 2)
[3]
Got:
p = 2: True by 2-descent
Timeout stopped Heegner index computation...
Proceeding to use heegner_index_bound instead.
True for p not in {2, 3} by Kolyvagin.
p = 3 may divide the Heegner index, for which only a bound was
computed.
ALERT: p = 3 left in Kolyvagin bound
0 <= ord_p(#Sha) <= 2
ord_p(#Sha_an) = 2
Remaining primes:
p = 3: irreducible, surjective, non-split multiplicative
(0 <= ord_p <= 2)
[3]
**********************************************************************
1 items had failures:
1 of 35 in __main__.example_6
***Test Failed*** 1 failures.
For whitespace errors, see the file /export/home/drkirkby/.sage//
tmp/.doctest_BSD.py
[133.8 s]
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
