Whitepapers

During the development of libfreevec, or development in AltiVec, we sometimes faced some quite complex algorithms, that were not really obvious how to vectorize. For these cases it was decided to write some papers describing in detail, how the vectorization for these particular algorithms works.

Eventually, a complete paper will published describing the internals of libfreevec, but that will have to wait for the moment. Until then, we hope these will suffice:

Title	Paper	Source	Comments
Vectorization of hashing algorithm Adler32			includes mathematical proof
Vectorization of a family hashing algorithm			includes mathematical proof
Vectorization of the Insertion Sort Algorithm			Also includes presentation of an N-way Merge Sort algorithm (scalar for now)

Presentations

Also, here are a couple of recent presentations on AltiVec/libfreevec:

(N/A)Konstantinos Margaritis
Introduction to Altivec, first presentation of libfreevec
Czestochowa Polytechnic University, March 2005

OOo Impress: Powerpoint: PDF:
Konstantinos Margaritis
Altivec presentation, integration into Debian(Linux)
Debconf5, Helsinki, July 2005
(Updated visuals thanks to André Siegel)