commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: [math] Iterative linear solvers (MATH-581) again
Date Fri, 08 Jul 2011 15:06:41 GMT
As your measurements indicate, the allocation of large objects is rarely a
speed issue.  It can be a memory fragmentation issue, but a full GC will fix
that as well.

People who are stressed about allocation of result vectors such as what you
are doing are mostly worried about the wrong thing.

2011/7/8 S├ębastien Brisard <sebastien.brisard@m4x.org>

> The thing is the first option is not frequently met in Commons-Math.
> I've started to work with this option for iterative linear solvers,
> but I do not like the inconsistent feel it has with the rest of CM.
> Also, very crude monitoring on rather large linear systems (800,000 x
> 800,000)  shows that memory allocations are not even measurable... As
> I said, I read that a long time ago, and someone already mentioned on
> this forum that GC is getting pretty good those days... So is it
> really worth worrying about memory allocation?
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message