A data locality methodology for matrix-matrix multiplication algorithm

  • Alachiotis, Nikolaos
  • Kelefouras, Vasileios
  • Athanasiou, George
  • Michail, Harris E.
  • Kritikakou, Angeliki
  • Goutis, Costas E.
ORKG logo Add to ORKG
Publication date
February 2012
Publisher
Springer Science and Business Media LLC

Abstract

Matrix-Matrix Multiplication (MMM) is a highly important kernel in linear algebra algorithms and the performance of its implementations depends on the memory utilization and data locality. There are MMM algorithms, such as standard, Strassen–Winograd variant, and many recursive array layouts, such as Z-Morton or U-Morton. However, their data locality is lower than that of the proposed methodology. Moreover, several SOA (state of the art) self-tuning libraries exist, such as ATLAS for MMM algorithm, which tests many MMM implementations. During the installation of ATLAS, on the one hand an extremely complex empirical tuning step is required, and on the other hand a large number of compiler options are used, both of which are not included in t...

Extracted data

Loading...

Related items

A high performance Matrix-Matrix Multiplication Methodology for CPU and GPU architectures
  • Kelefouras, Vasilios
  • Kritikakou, Angeliki
  • Mporas, Iosif
  • Kolonias, Vasilios
January 2016

International audienceCurrent compilers cannot generate code that can compete with hand-tuned code i...

A high-performance matrix-matrix multiplication methodology for CPU and GPU architectures
  • Kelefouras, Vasileios
  • Kritikakou, Angeliki
  • Mporas, Iosif
  • Vasileios, Kolonias
January 2016

Current compilers cannot generate code that can compete with hand-tuned code in efficiency, even for...

Tuning Strassen's Matrix Multiplication for Memory Efficiency
  • Mithuna Thottethodi
  • Alvin R. Lebeck
  • Siddhartha Chatterjee
January 1998

Strassen's algorithm for matrix multiplication gains its lower arithmetic complexityatthe expe...

We use cookies to provide a better user experience.