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) |
From: | marjan.sterk@ijs.si (Marjan Sterk) |
Newsgroups: | comp.compilers |
Date: | 31 Mar 2002 23:32:00 -0500 |
Organization: | Jozef Stefan Institute |
References: | 02-03-151 |
Keywords: | C, optimize |
Posted-Date: | 31 Mar 2002 23:32:00 EST |
On 22 Mar 2002 21:03:51 -0500, "H. Ellenberger" <ele1@gmx.ch> wrote:
>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?
Visual C++ 6, for example. I tested a small loop program (not exactly
matrix mult.) - the speed was the same whether I used pointers or
simple indices. With optimization turned off, however, the pointer
version was about twice as fast as the simple version.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.