Experiments in parallel matrix multiplication on multi-core systems

Authors:
Joeffrey Legaux;Sylvain Jubertie;Frédéric Loulergue
Affiliations:
LIFO, University of Orléans, France;LIFO, University of Orléans, France;LIFO, University of Orléans, France
Venue:
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2012

Citing 10
Cited 0

An empirical validation of software cost estimation models

Communications of the ACM
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Algorithmic skeletons: structured management of parallel computation

Algorithmic skeletons: structured management of parallel computation
Elements of Software Science (Operating and programming systems series)

Elements of Software Science (Operating and programming systems series)
MMX Technology Extension to the Intel Architecture

IEEE Micro
Performance Analysis of Intel's MMX and SSE: A Case Study

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A complexity measure

ICSE '76 Proceedings of the 2nd international conference on Software engineering
Adaptive Strassen and ATLAS's DGEMM: A Fast Square-Matrix Multiply for Modern High-Performance Systems

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
A survey of algorithmic skeleton frameworks: high-level structured parallel programming enablers

Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Matrix multiplication is an example of application that is both easy to specify and to provide a simple implementation. There exist numerous sophisticated algorithms or very efficient complex implementations. In this study we are rather interested in the design/programming overhead with respect to performance benefits. Starting from the naive sequential implementation, the implementation is first optimised by improving data accesses, then by using vector units of modern processors, and we finally propose a parallel version for multi-core architectures. The various proposed optimisations are experimented on several architectures and the trade-off software complexity versus efficiency is evaluated using Halstead metrics.