Re: Optimizations in C/C++ code doing matrix multiplications

"H. Ellenberger" <ele1@gmx.ch>
31 Mar 2002 23:20:51 -0500

          From comp.compilers
Related articles
Optimizations in C/C++ code doing matrix multiplications ele1@gmx.ch (H. Ellenberger) (2002-03-22)
Re: Optimizations in C/C++ code doing matrix multiplications ele1@gmx.ch (H. Ellenberger) (2002-03-31)
Re: Optimizations in C/C++ code doing matrix multiplications marjan.sterk@ijs.si (2002-03-31)
Re: Optimizations in C/C++ code doing matrix multiplications mark@marklacey.com (2002-04-06)
Re: Optimizations in C/C++ code doing matrix multiplications lars.gregersen@it.dk (2002-04-06)
Re: Optimizations in C/C++ code doing matrix multiplications terryg@qwest.net (Terry Greyzck) (2002-04-07)
| List of all articles for this month |
From: "H. Ellenberger" <ele1@gmx.ch>
Newsgroups: comp.compilers
Date: 31 Mar 2002 23:20:51 -0500
Organization: Swisscom IP+ (post doesn't reflect views of Swisscom)
References: 02-03-151
Keywords: optimize, practice
Posted-Date: 31 Mar 2002 23:20:51 EST

"H. Ellenberger" wrote:


> When matrix multiplication is programmed the same way it is
> mathematically defined, then two nested loops running through all
> valid indices are used. ...
>
> Which compilers are smart enough to automagically optimize this kind
> of data acess by introducing hidden pointer variables (in registers)
> incremented and thus avoiding most multiplications?


>
> [It's my impression that people who care about fast and, accurate matrix
> multiplication use linpack rather than reinventing it. -John]


John, that may be fully correct for those actually _doing_ a lot of
matrix multiplication.


However, I've heard that a certain (neglectable ;-) minority is said
to be interested in compiler technology and the current state of the
art.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.