Assessment of Two Task Frameworks with Dependencies for Matrix Factorizations on a Multicore Architecture
Keywords:Task parallelism, task dependencies, parallel programming model, runtime system, OpenMP, Intel TBB
AbstractIn this study, we evaluate two task frameworks with dependencies for important application kernels coming from the numerical linear algebra. In this approach, the algorithms of the matrix factorization are considered, namely the tiled LU and the WZ factorizations both without pivoting. In tiled algorithms, the operations are represented as a sequence of small tasks which operate on square blocks (tiles) of the data. The dependencies among tasks are expressed as a direct acyclic graph and the runtime system runs the graph on a multicore architecture. The performance of applications based on the task dependencies is related to efficient compilers and the runtime systems. We report the performance and the scalability of two task frameworks with dependencies on the multicore architecture for the matrix factorizations. Namely, we compare OpenMP and Intel Thread Building Blocks. Our results show that the number of tiles in both factorizations always have an impact on the performance and the speedup. Both the frameworks show their suitability for efficient parallelization of such applications, although both have their own merits and flaws.
Download data is not yet available.
How to Cite
Bylina, J. (2019). Assessment of Two Task Frameworks with Dependencies for Matrix Factorizations on a Multicore Architecture. COMPUTING AND INFORMATICS, 38(1), 197–222. https://doi.org/10.31577/cai_2019_1_197