Semiempirical Molecular Dynamics (SEMD) I: Midpoint-Based Parallel Sparse Matrix–Matrix Multiplication Algorithm for Matrices with Decay

2015 ◽  
Vol 11 (7) ◽  
pp. 3145-3152 ◽  
Author(s):  
Valéry Weber ◽  
Teodoro Laino ◽  
Alexander Pozdneev ◽  
Irina Fedulova ◽  
Alessandro Curioni
Keyword(s):  
Molecular Dynamics ◽  
Sparse Matrix ◽  
Matrix Multiplication ◽  
Matrix Multiplication Algorithm ◽  
Multiplication Algorithm

Simple sparse matrix multiplication algorithm

1995 ◽  
Vol 85 (2) ◽  
pp. 213-216 ◽  
Author(s):  
Daniel Král ◽  
Pavel Neogrády ◽  
Vladimir Kellö
Keyword(s):  
Sparse Matrix ◽  
Matrix Multiplication ◽  
Matrix Multiplication Algorithm ◽  
Multiplication Algorithm

scholarly journals Autotuning LLVM OptimizationPasses for Matrix Multiplication in Rust

2020 ◽  
Author(s):  
Emanuel Lima de Sousa ◽  
Pedro Bruel ◽  
Alfredo Goldman
Keyword(s):  
Execution Time ◽  
Expert Knowledge ◽  
Matrix Multiplication ◽  
Intermediate Representation ◽  
Matrix Multiplication Algorithm ◽  
Search Spaces ◽  
Multiplication Algorithm ◽  
Ongoing Work ◽  
Compiler Framework

The LLVM compiler framework transforms its Intermediate Representation (IR) to optimize code. These transformations are controlled by flags which interfere on metrics such as the execution time. Selecting flags to improve the execution time of a program is difficult, and requires expert knowledge. Autotuning methods can automate parts of this process and help understanding the underlying search spaces. This paper describes ongoing work, showing that LLVM flags can impact the execution time of a Rust matrix multiplication algorithm, and planning future autotuning experiments for flag selection.

Sign in / Sign up

Export Citation Format

Share Document