Optimizing data permutations for SIMD devices

The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficult issues that must be addressed by these techniques is the generation of the data permutation instructions needed for non-contiguous and misaligned memory references. These instructions are expensive and, therefore, it is of crucial importance to minimize their number to improve performance and, in many cases, enable speedups over scalar code. Although it is often difficult to optimize an isolated data reorganization operation, a collection of related data permutations can often be manipulated to reduce the number of operations. This paper presents a strategy to optimize all forms of data permutations. The strategy is organized into three steps. First, all data permutations in the source program are converted into a generic representation. These permutations can originate from vector accesses to non-contiguo...

• Type: Conference
• Year: 2006
• Where: PLDI
• Authors: Gang Ren, Peng Wu, David A. Padua
• Keywords: Data Permutations, Permutation Instructions, PLDI 2006, Programming Languages, Related Data Permutations