A New Compiler Framework based on Superword Level Parallel

doi:10.23940/ijpe.18.10.p27.25112521

Abstract

Abstract:

Superword level parallel (SLP) algorithm is an automatic vectorization method that is suitable for the applications including parallel codes. Existing SLP algorithm could not efficiently deal with the applications that contain few parallel codes. In the present study, a new compile framework based on the improved SLP algorithm is presented. The framework contains three phases: isomorphic processing for isomeric statements, establishment of superword statements, and data layout optimization. Firstly, isomeric statements with similar instruction in the codes were transformed to isomorphic statements by the improved SLP algorithm. Secondly, the superwords reuse patterns were obtained before making the optimization decisions from a global point of view. Finally, data layout optimization was combined for further performance improvement. The experimental results indicated that the optimization of the compile framework was better than existing SLP algorithm.

Submitted on July 21, 2018; Revised on August 23, 2018; Accepted on September 28, 2018
References: 18

Zhanjie Guo Hui Liu. A New Compiler Framework based on Superword Level Parallel [J]. Int J Performability Eng, 2018, 14(10): 2511-2521.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

References 0

	J. Liu, Y. R. Zhang, O. Jang, W. Ding, and M. Kandemir, “A Compiler Framework for Extracting Superword Level Parallelism,” in Proceedings of the Conference on Programming Language Design and Implementation, pp. 347-357, Beijing, China, June 2012
	V. Porpodas, A. Magni, and T. M. Jones, “PSLP: Padded SLP Automatic Vectorization,” in Proceedings of the 13th Annual IEEE/ACM International Symposium on Code Generation and Optimization, pp. 190-201, San Francisco, California, February 2015
	W. Gao, R. C. Zhao, and L. Han, “Research on SIMD Auto-Vectorization Compiling Optimization,” Journal of Software, Vol. 26, No. 6, pp. 1265-1284, 2015
	M. Kong, N. Pouchet, and P. Sadayappan, “Abstract Vector SIMD Code Generation using the Polyhedral Model,” Technical Report 4/13-TR08, Ohio State University, 2013
	S. Larsen and S. Amarasinghe, “Exploiting Superword Level Parallelism with Multimedia Instruction Sets,” in Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, pp. 145-156, New Orleans, USA, June 2000
	R. Lei?a, S. Hack, and I. Wald, “Extending a C-Like Language for Portable SIMD Programming,” in Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pp. 65-74, New Orleans, USA, June 2012
	Y. Park, S. Seo, H. Park, H. K. Cho, and S. Mahlke, “SIMD Defragmenter: Efficient ILP Realization on Data-Parallel Architectures,” in Proceedings of the 17th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 363-374, London, UK, March 2012
	B. Ren, G. Agrawal, and J. R. Larus, “Fine-Grained Parallel Traversals of Irregular Data Structures,” in Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques, pp. 461-462, Minneapolis, USA, September 2012
	N. Vasilache, B. Meister, M. M. Baskaran, and R. Lethin, “Joint Scheduling and Layout Optimization to Enable Multi-Level Vectorization,” in Proceedings of the International Workshop on Polyhedral Compilation Techniques, pp. 23-31, Paris, France, January 2012
	J. Shin, J. Chame, and M. W. Hall, “Compiler-Controlled Caching in Superword Register Files for Multimedia Extension Architectures,” in Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques, pp. 45-55, Charlottesville, Virginia, September 2002
	J. Shin, J. Chame, and M. W. Hall, “Exploiting Superword-Level Locality in Multimedia Extension Architectures,” Journal of Instruction Level Parallelism, Vol. 5, pp. 1-28, 2003
	J. Shin, “Compiler Optimizations for Architectures Supporting Superword-Level Parallelism,” PhD Thesis, University of Southern California Los Angeles, USA, 2005
	J. Shin, M. W. Hall, and J. Chame, “Superword-Level Parallelism in the Presence of Control Flow,” in Proceedings of International Symposium on Code Generation and Optimization, pp. 165-175, San Jose, California, March 2005
	C. Tenllado, L. Pi?uel, M. Prieto, et al., “Pack Transposition: Enhancing Superword Level Parallelism Exploitation,” in Proceedings of the International Conference Parallel Computing: Current & Future Issues of High-End Computing, pp. 13-16, September 2005
	C. Tenllado, M. Prieto, F. Tirado, and F. Catthoor, “Improving Superword Level Parallelism Support in Modern Compilers,” in Proceedings of the 3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, pp. 19-21, Jersey City, USA, September 2005
	D. Nuzman, I. Rosen, and A. Zaks, “Auto-Vectorization of Interleaved Data for SIMD,” in Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, pp. 132-143, Ottawa, Canada, June 2006
	D. Nuzman and A. Zaks, “Outer-Loop Vectorization: Revisited for Short SIMD Architectures,” in Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, pp. 2-11, Toronto, Canada, October 2008
	R. Barik, J. Zhao, and V. Sarkar, “Efficient Selection of Vector Instructions using Dynamic Programming,” in Proceedings of IEEE/ACM International Symposium on Microarchitecture, pp. 201-212, Atlanta, USA, December 2010