Grain graphs: OpenMP performance analysis made easy

A Muddukrishna, PA Jonsson, A Podobas… - Proceedings of the 21st …, 2016 - dl.acm.org
Average programmers struggle to solve performance problems in OpenMP programs with
tasks and parallel for-loops. Existing performance analysis tools visualize OpenMP task …

Scalable atomistic simulation algorithms for materials research

A Nakano, RK Kalia, P Vashishta, TJ Campbell… - Proceedings of the …, 2001 - dl.acm.org
A suite of scalable atomistic simulation programs has been developed for materials research
based on space-time multiresolution algorithms. Design and analysis of parallel algorithms …

Measuring Thread Timing to Assess the Feasibility of Early-bird Message Delivery

WP Marts, MGF Dosanjh, W Schonbein… - Proceedings of the …, 2023 - dl.acm.org
Early-bird communication is a communication/computation overlap technique that combines
fine-grained communication with partitioned communication to improve application run-time …

Semantic Petri-Markov nets for automotive algorithms transformations

AN Ivutin, AG Troshina - 2018 28th International Conference …, 2018 - ieeexplore.ieee.org
The approach of automatic algorithms transformation into concurrent form is proposed. One
is based on mathematical apparatus of stochastic Petri nets with additional semantic …

Measuring Thread Timing to Assess the Feasibility of Early‐Bird Message Delivery Across Systems and Scales

WP Marts, MGF Dosanjh, W Schonbein… - Concurrency and …, 2025 - Wiley Online Library
Early‐bird communication is a communication/computation overlap technique that leverages
fine‐grained communication to improve application run‐time. Communication is divided …

Accelerating parallel computations with openmp-driven system-on-chip generation for fpgas

A Podobas - 2014 IEEE 8th International Symposium on …, 2014 - ieeexplore.ieee.org
The task-based programming paradigm offers a portable way of writing parallel applications.
However, it requires tedious tuning of the application for performance. We present a novel …

[PDF][PDF] Towards Aggregated Grain Graphs

N Reissmann, M Jahre… - Proceedings of the Fourth …, 2017 - researchgate.net
Grain graphs simplify OpenMP performance analysis by visualizing performance problems
from a fork-join perspective that is familiar to programmers. However, it is tedious to navigate …

Diagnosing highly-parallel openmp programs with aggregated grain graphs

N Reissmann, A Muddukrishna - Euro-Par 2018: Parallel Processing: 24th …, 2018 - Springer
Grain graphs simplify OpenMP performance analysis by visualizing performance problems
from a fork-join perspective that is familiar to programmers. However, when programmers …

Linearizing Computing the Power Set with OpenMP

RL Goodwin - 2021 IEEE International Parallel and Distributed …, 2021 - ieeexplore.ieee.org
This paper presents an alternative to computing the power set in a sequential computing
environment. The algorithms to compute the power set run concurrently on the Stampede2 …

Principles, Techniques, and Tools for Explicit and Automatic Parallelization

N Reissmann - 2019 - ntnuopen.ntnu.no
The end of Dennard scaling also brought an end to frequency scaling as a means to
improve performance. Chip manufacturers had to abandon frequency and superscalar …