On Sun, Nov 30, 2008 at 12:37 PM, Martin Albrecht <[EMAIL PROTECTED]> wrote: > >> Here's another example: >> 64-bit: >> sage: time a = random_matrix(ZZ,200).determinant() >> CPU times: user 2.74 s, sys: 0.01 s, total: 2.75 s >> >> 32-bit: >> sage: time a = random_matrix(ZZ,200).determinant() >> CPU times: user 0.74 s, sys: 0.04 s, total: 0.78 s >> >> Here, surprisingly, 64-bit is WAY SLOWER than 32-bit at doing the >> exact same thing. I don't really understand this. The moral should I >> think be that 32 versus 64 bit can be really subtle when it comes to >> performance. > > It seems to me that this should be considered a bug.
I don't think "bug" is the right word -- however, fixing this or giving a good explanation should be considered an "Enhancement". I'm surprised about the speed difference. It's very likely in either IML or Linbox. William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com 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 -~----------~----~----~----~------~----~------~--~---
