Experimental design and analysis of polyhedral optimization algorithm based on LoongArch64 architecture
Authors: 
Jia He, Wei XuAuthors Info & Claims
Jia He, Wei XuAuthors Info & ClaimsPages 212 - 217
Abstract
The purpose of this paper is to research and experiment polyhededral model algorithm on the LoongArch64 architecture. In order to reduce the burden on programmers and adapt to the development of parallel programs on the Loongson multi-core chip, using the polyhedral model algorithm to automatically parallelize the program: calculate the program control flow information and active variable information, extract the program polyhedral feature iteration domain, schedule. The tree and memory access relationship calculate the dependency relationship between instances, and optimize the program parallelization to meet the dependency relationship, improving data locality and program parallelism. In this paper, it is tested that the optimization of the polyhedral model can effectively improve the data locality characteristics.
References
[1]
HongBing Wu. 2015 “Study of Key Technologies of Network Processing PLoongArchtform Based on Many-core” national university of defense technology, changsha.
[2]
M. R. Pimple and S. R. Sathe. 2011. Computing on multi-core platform: performance issues. In Proceedings of the 2011 International Conference on Communication, Computing & Security (ICCCS ’11), Association for Computing Machinery, New York, NY, USA, 269–272.
[3]
Jie Zhao and YingYing and Li, RongCai Zhao. 2018, “Black magic” of polyhedral compilation. Ruan Jian Xue Bao/Journal of Software, vol. 29, no. 8, pp. 2371−2396.
[4]
Uday Bondhugula, Albert Hartono, J. Ramanujam, and P. Sadayappan. 2008. A practical automatic polyhedral parallelizer and locality optimizer. In Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI ’08), Association for Computing Machinery, New York, NY, USA, 101–113.
[5]
Sven Verdoolaege, Juan Carlos Juega, Albert Cohen, José Ignacio Gómez, Christian Tenllado, and Francky Catthoor. 2013. Polyhedral parallel code generation for CUDA. ACM Trans. Archit. Code Optim. 9, 4 (January 2013), 54:1-54:23.
[6]
Sanyam Mehta, Pei-Hung Lin, and Pen-Chung Yew. 2014. Revisiting loop fusion in the polyhedral framework. In Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP ’14), Association for Computing Machinery, New York, NY, USA, 233–246.
[7]
WeiWu Hu, WenXiang Wang, RuiYang Wu, HuanDong Wang, Zeng Lu, ChengHua Xu, Xiang Gao, FuXing Zhang. 2023.“Loongson Instruction Set Architecture Technology.“ Journal of Computer Research and Development, vol. 60, no 1,pp. 2-16.
[8]
WeiWu Hu. 2022. “Loongson basic software ecological construction ideas“. Software and integrated circuit, pp. 48-51.
[9]
Jie Zhao, BaoLiang Li. 2022. “Polyhedral Compilation Theory and Its Practice in Deep Learning”. Tsinghua University Press. Bei Jing. pp. 1-23
[10]
Sven Verdoolaege. 2010. isl: An Integer Set Library for the Polyhedral Model. In Mathematical Software – ICMS 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 299–302.
[11]
Andreas Gal, Christian W. Probst, and Michael Franz. 2008. Java bytecode verification via static single assignment form. ACM Trans. Program. Lang. Syst. 30, 4 (August 2008), 21:1-21:21.
[12]
Sven Verdoolaege, Serge Guelton, Tobias Grosser, and Albert Cohen. 2014. Schedule Trees.
[13]
GuoYun Sun, Qi Ao and Rui wang. 2022. “Assembly Language for LoongArch”. The People's Posts and Telecommunications Press, Bei Jing. pp. 75-81.
[14]
Massimiliano Poletto and Vivek Sarkar. 1999. Linear scan register allocation. ACM Trans. Program. Lang. Syst. 21, 5 (September 1999), 895–913.
[15]
Christian Wimmer and Michael Franz. 2010. Linear scan register allocation on SSA form. In Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization (CGO ’10), Association for Computing Machinery, New York, NY, USA, 170–179.
[16]
Christian Wimmer and Hanspeter Mössenböck. 2005. Optimized interval splitting in a linear scan register allocator. In Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments (VEE ’05), Association for Computing Machinery, New York, NY, USA, 132–141.
Index Terms
- Experimental design and analysis of polyhedral optimization algorithm based on LoongArch64 architecture
Index terms have been assigned to the content through auto-classification.
Recommendations
A Polyhedral Modeling Based Source-to-Source Code Optimization Framework for GPGPU
IPDPSW '12: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD ForumIn this paper, we propose a source-to-source code optimization framework for general purpose computing on graphics processing units (GPGPU). Our framework is based on a re-formulation of the polyhedral loop transformation theory under the context of ...
Improving high level synthesis optimization opportunity through polyhedral transformations
FPGA '13: Proceedings of the ACM/SIGDA international symposium on Field programmable gate arraysHigh level synthesis (HLS) is an important enabling technology for the adoption of hardware accelerator technologies. It promises the performance and energy efficiency of hardware designs with a lower barrier to entry in design expertise, and shorter ...
Practical SIMD Vectorization Techniques for Intel® Xeon Phi Coprocessors
IPDPSW '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD ForumIntel® Xeon Phi™ coprocessor is based on the Intel® Many Integrated Core (Intel® MIC) architecture, which is an innovative new processor architecture that combines abundant thread parallelism with long SIMD vector units. Efficiently exploiting SIMD ...
Comments
Information & Contributors
Information
Published In
September 2023
227 pages
ISBN:9798400707629
DOI:10.1145/3625403
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 November 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ADMIT 2023
ADMIT 2023: 2023 2nd International Conference on Algorithms, Data Mining, and Information Technology
September 15 - 17, 2023
Chengdu, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 28Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format