commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Ted Dunning" <>
Subject Re: [math] new DenseRealMatrix
Date Sat, 20 Dec 2008 01:04:50 GMT
Interesting approach.  I will be real interested in hearing your results
with this compared to the traditional row or column major storage mode.

On Fri, Dec 19, 2008 at 4:29 PM, Luc Maisonobe <>wrote:

> ... <>The new DenseRealMatrix tries to be more
> cache-friendly. The matrix is
> split in square blocks (32x32 blocks currently) except the blocks on the
> right and bottom sides which may be smaller. Each block is flattened in
> row major order in an array. These arrays are therefore 1024 elements
> long for regular blocks, and smaller for  border blocks. Most algorithms
> can be organized to process each block completely before needing to load
> the next block in memory. This is were the performance gain occurs.

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