Hello all,
I am resending my message to this list after I have send it to the
MTL4 list in case someone can help here.
I am working on Peano order matrix recursive multiplication traversal.
In the paper "representation-transparent Matrix Algorithms with
scalable performance" by Gottschling et al., it is mentioned that
using MTL4 it is easy to choose the order by changing the Bit-Mask
representation of the matrix.
I would like to ask if anyone knows or have experienced on changing
the order using the bit-masks and whether this can be done through
passing some parameters to the matrix type, or it requires some work
on the predefined bit-masks in the library header files
(predefinedmasks.hpp, recursion.hpp, bit-masking.hpp(generatemask
class) ).
thanks.
----------------------------------------------------------------
_______________________________________________
This list is archived at
http://www.osl.iu.edu/MailArchives/mtl-devel/
