This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]

Re: A bit of vector extension documentation

To: Daniel Berlin <dan at cgsoftware dot com>
Subject: Re: A bit of vector extension documentation
From: Richard Henderson <rth at redhat dot com>
Date: Fri, 28 Sep 2001 09:38:34 -0700
Cc: Daniel Egger <degger at fhm dot edu>, gcc-patches at gcc dot gnu dot org, gcc at gcc dot gnu dot org
References: <20010928013241.A13628@redhat.com> <4428951C-B428-11D5-9625-0030657B5340@cgsoftware.com>

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.

r~

Follow-Ups:
- Re: A bit of vector extension documentation
  - From: David Edelsohn
- Re: A bit of vector extension documentation
  - From: Daniel Berlin

References:
- Re: A bit of vector extension documentation
  - From: Richard Henderson
- Re: A bit of vector extension documentation
  - From: Daniel Berlin

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]