On Sun, May 3, 2009 at 6:33 PM, mabshoff <[email protected]> wrote: > > FYI: Simon's patch doesn't make any difference for the amount of > memory used for > > > sage: while p<2^20: > ....: p=next_prime(p) > ....: g=FindGroupOrder(p,11) > ....: > > In both cases about 2046MB more were used after the loop :(.
Note however that running just a loop where the polynomial ring is created does benefit from the change in Simon's patch: doing it for p up to 2^17, this used to eat up 272MB, and after the patch it's only taking 10MB. I did experience the same phenomenon that Michael is describing when running loops where elliptic curves (or even just plane curves) are created. The patch seems to have no effect on those loops. Alex -- Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne -- Australia -- http://www.ms.unimelb.edu.au/~aghitza/ --~--~---------~--~----~------------~-------~--~----~ 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-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
