MTL

Dear folks,

being interested in linear algebra performances in general and in C++ in
particular, I found your site by chance looking at a Stanford document.  So
I downloaded and tested version mtl-2.1.2-21 and looked at the matrix-matrix
multiply on dense matrices from your test dir, something known in Blas as
the DGEMM operation (or rank-k update). This operation sits at the core of
all real linalg, whether direct or iterative and gets huge benefit from
caching/blocking operations.

Although with a recent Intel 7.0 C++ compiler and STLPORT I could easily get
the same performances as straight C code,  this never came close to the
performances of the Intel MKL library (factor of 10..30!!!). So I am
questioning the reality of the performance results that you advocate in your
publications.  Did you really compare it with MKL or an equivalent, such as
the Goto or Atlas Blas?

Thanks for your help,

Jean-Marie Marchal


_______________________________________________
This list is archived at http://www.osl.iu.edu/MailArchives/mtl-devel/