Matrix Multiplication Vector Code Generation Based on Polyhedron Model

Matrix multiplication is the core of many scientific calculations, and vectorized programming is one of the main means to improve its performance.In view of the existing vectorization optimization problems that often require manual tuning and need to be mapped to the hardware structure, based on the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Ji suan ji ke xue Ročník 49; číslo 10; s. 44 - 51
Hlavní autoři: Wang, Bo-Yang, Pang, Jian-Min, Xu, Jin-Long, Zhao, Jie, Tao, Xiao-Han, Zhu, Yu
Médium: Journal Article
Jazyk:čínština
Vydáno: Chongqing Guojia Kexue Jishu Bu 01.10.2022
Editorial office of Computer Science
Témata:
ISSN:1002-137X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Matrix multiplication is the core of many scientific calculations, and vectorized programming is one of the main means to improve its performance.In view of the existing vectorization optimization problems that often require manual tuning and need to be mapped to the hardware structure, based on the polyhedron compiler PPCG,a vector code generation framework is introduced into the polyhedron model, and a matrix multiplication vector code generation framework based on the polyhedron model is proposed.Through the profit analysis of the matrix multiplication vectorization program, the vectorization program is determined, and the code generation of the application framework is guided.Based on this framework, it is conducive to the rapid optimization of vectorization of matrix multiplication.Selecting 13 matrix multiplication cases with a scale between 64×64×64 and 1 024×1 024×1 024 for experiments.The results show that the framework can generate vectorized code correctly.Compared with the automatic vectorization
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1002-137X
DOI:10.11896/jsjkx.210800247