Integration and exploitation of intra-routine malleability in BLIS

Malleability is a property of certain applications (or tasks) that, given an external request or autonomously, can accommodate a dynamic modification of the degree of parallelism being exploited at runtime. Malleability improves resource usage (core occupation) on modern multicore architectures for...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing 2020-04, Vol.76 (4), p.2860-2875
Main Authors: Rodríguez-Sánchez, Rafael, Igual, Francisco D., Quintana-Ortí, Enrique S.
Format: Article
Language:English
Subjects:
Compilers
Computer architecture
Computer Science
High Performance Computing in Science and Engineering - CMMSE-2019
Interpreters
Linear algebra
Processor Architectures
Programming Languages
Subroutines
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Malleability is a property of certain applications (or tasks) that, given an external request or autonomously, can accommodate a dynamic modification of the degree of parallelism being exploited at runtime. Malleability improves resource usage (core occupation) on modern multicore architectures for applications that exhibit irregular and divergent execution paths and heavily depend on the underlying library performance to attain high performance. The integration of malleability within high-performance instances of the Basic Linear Algebra Subprograms (BLAS) is nonexistent, and, in addition, it is difficult to attain given the rigidity of current application programming interfaces (APIs). In this paper, we overcome these issues presenting the integration of a malleability mechanism within BLIS, a high-performance and portable framework to implement BLAS-like operations. For this purpose, we leverage low-level (yet simple) APIs to integrate on-demand malleability across all Level-3 BLAS routines, and we demonstrate the performance benefits of this approach by means of a higher-level dense matrix operation: the LU factorization with partial pivoting and look-ahead.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-019-03078-z