Performance Tuning of Tile Matrix Decomposition

Task parallel algorithms have attracted attention as algorithms for highly parallel architectures in recent years. The aim of such algorithms is to keep all computing resources running without stalling by executing a large number of fine-grained tasks asynchronously while observing data dependencies...

Full description

Saved in:

Bibliographic Details
Published in:	2019 IEEE 13th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) pp. 25 - 31
Main Author:	Suzuki, Tomohiro
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2019
Subjects:	Computational modeling Kernel Matrix decomposition multi-core/many-core architecture Numerical models Plasmas Symmetric matrices Task analysis tile algorithm
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Task parallel algorithms have attracted attention as algorithms for highly parallel architectures in recent years. The aim of such algorithms is to keep all computing resources running without stalling by executing a large number of fine-grained tasks asynchronously while observing data dependencies. The tile algorithm of matrix decomposition of dense matrices is implemented using a task parallel programming model following such an approach. In this article, we will consider how to select tile size, which is an important performance parameter.
DOI:	10.1109/MCSoC.2019.00011