Improving performance visualization of OpenMP task-based applications

OpenMP is becoming a more powerful environment for exploiting task-based parallelism. Recent specification versions add support for new task clauses, while the OMPT interface provides a standard API for performance monitoring. In this paper, we present a workflow to improve the performance visualization of OpenMP task-based applications. We rely on open-source solutions such as the Tikki OMPT tracing tool and the StarVZ performance analysis framework to create enriched space-time views. We demonstrate this workflow with three applications: Strassen matrix multiply, SparseLU factorization, and a dense Cholesky factorization. For two of them, our strategy enables a better understating of the performance impact of the OpenMP task depend, task wait, and priority constructions.

Authors

Publication Details

Published
2024-10-23
DOI
https://doi.org/10.5753/sscad.2024.244795
Citations
1
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving performance visualization of OpenMP task-based applications

Vinícius Garcia Pinto, Christian Einhardt Sousa Filho
1 citations
Parallel Computing and Optimization Techniques
0.49
article

Improving performance visualization of OpenMP task-based applications

Vinícius Garcia Pinto, Christian Einhardt Sousa Filho
article en
1 citations

Abstract

OpenMP is becoming a more powerful environment for exploiting task-based parallelism. Recent specification versions add support for new task clauses, while the OMPT interface provides a standard API for performance monitoring. In this paper, we present a workflow to improve the performance visualization of OpenMP task-based applications. We rely on open-source solutions such as the Tikki OMPT tracing tool and the StarVZ performance analysis framework to create enriched space-time views. We demonstrate this workflow with three applications: Strassen matrix multiply, SparseLU factorization, and a dense Cholesky factorization. For two of them, our strategy enables a better understating of the performance impact of the OpenMP task depend, task wait, and priority constructions.

Openalex Percentile: Top 36%
Parallel Computing and Optimization Techniques
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.