Hybrid type legalization for a sparse SIMD instruction set


SIMD vector units implement only a subset of the operations used by vectorizing compilers, and there are multiple conflicting techniques to legalize arbitrary vector types into register-sized data types. Traditionally, type legalization is performed using a set of predefined rules, regardless of the operations used in the program. This method is not suitable to sparse SIMD instruction sets and often prevents the vectorization of programs. In this work we introduce a new technique for type legalization, namely vector element promotion, as well as a hybrid method for combining multiple techniques of type legalization. Our hybrid type legalization method makes decisions based on the knowledge of the available instruction set as well as the operations used in the program. Our experimental results demonstrate that program-dependent hybrid type legalization improves the execution time of vector programs, outperforms the existing legalization method, and allows the vectorization of workloads which were not vectorized before.

DOI: 10.1145/2509420.2509422

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{BenAsher2008HybridTL, title={Hybrid type legalization for a sparse SIMD instruction set}, author={Yosi Ben-Asher and Nadav Rotem}, journal={TACO}, year={2008}, volume={10}, pages={11:1-11:14} }