A bit of vector extension documentation

[Daniel Berlin]

On Friday, September 28, 2001, at 12:38  PM, Richard Henderson wrote:

> On Fri, Sep 28, 2001 at 11:48:31AM -0400, Daniel Berlin wrote:
>> It's based on the algorithms in the paper "Exploiting superword level
>> parallelism with multimedia instruction sets"
>> http://www.acm.org/pubs/citations/proceedings/pldi/349299/p145-larsen/
>
> Yes, I've seen that one.  While a nice starting point, I don't
> think it's as powerful as some of the other loop-based vectorization
> algorithms.
I'm curious what makes you say that.
It actually should be more powerful than loop based vectorization 
algorithms.
Except maybe in some very specialized cases.
>
>
>
> r~