DeepAI AI Chat
Log In Sign Up

Towards scalable pattern-based optimization for dense linear algebra

by   Dániel Berényi, et al.

Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient machine-level representations is far from trivial: developers should be assisted by automatic optimization tools so that they can focus their attention on high-level problems, rather than low-level details. The tractability of these optimizations is highly dependent on the choice of the primitive constructs in terms of which the computations are to be expressed. In this work we propose to describe operations on multi-dimensional arrays using a selection of higher-order functions, inspired by functional programming, and we present rewrite rules for these such that they can be automatically optimized for modern hierarchical and heterogeneous architectures. Using this formalism we systematically construct and analyse different subdivisions and permutations of the dense matrix multiplication problem.


page 1

page 2

page 3

page 4


MOM: Matrix Operations in MLIR

Modern research in code generators for dense linear algebra computations...

Linnea: Automatic Generation of Efficient Linear Algebra Programs

The translation of linear algebra computations into efficient sequences ...

Co-Design of the Dense Linear AlgebravSoftware Stack for Multicore Processors

This paper advocates for an intertwined design of the dense linear algeb...

On the Efficacy and High-Performance Implementation of Quaternion Matrix Multiplication

Quaternion symmetry is ubiquitous in the physical sciences. As such, muc...

TAMM: Tensor Algebra for Many-body Methods

Tensor contraction operations in computational chemistry consume signifi...

Extending Functional Languages with High-Level Exception Handling

We extend functional languages with high-level exception handling. To be...

Learning an Astronomical Catalog of the Visible Universe through Scalable Bayesian Inference

Celeste is a procedure for inferring astronomical catalogs that attains ...