Shared-Memory Parallel Probabilistic Graphical Modeling Optimization: Comparison of Threads, OpenMP, and Data-Parallel Primitives
- 15 June 2020
- book chapter
- Published by Springer Nature
- Vol. 12151, 127-145
Abstract
This work examines performance characteristics of multiple shared-memory implementations of a probabilistic graphical modeling (PGM) optimization code, which forms the basis for an advanced, state-of-the art image segmentation method. The work is motivated by the need to accelerate scientific image analysis pipelines in use by experimental science, such as at x-ray light sources, and is motivated by the need for platform-portable codes that perform well across many different computational architectures. The primary focus of this work and its main contribution is an in-depth study of shared-memory parallel performance of different implementations, which include those using alternative parallelization approaches such as C11-threads, OpenMP, and data parallel primitives (DPPs). Our results show that, for this complex data-intensive algorithm, the DPP implementation exhibits better runtime performance, but also exhibits less favorable scaling characteristics than the C11-threads and OpenMP counterparts. Based upon a set of experiments that collect hardware performance counters on multiple platforms, the reason for the runtime performance difference appears to be due primarily to algorithmic efficiency gains: the reformulation from the traditional C11-threads and OpenMP expression of the solution into that of data parallel primitives results in significantly fewer instructions being executed. This study is the first of its type to do performance analysis using hardware counters for comparing methods based on VTK-m-based data-parallel primitives with those based on more traditional OpenMP or threads-based parallelism. It is timely, as there is increasing awareness of the need for platform portability in light of increasing node-level parallelism and increasing device heterogeneity.Keywords
This publication has 24 references indexed in Scilit:
- VTK-m: Accelerating the Visualization Toolkit for Massively Threaded ArchitecturesIEEE Computer Graphics and Applications, 2016
- Ray tracing within a data parallel framework2015
- CAMERA: The Center for Advanced Mathematics for Energy Research ApplicationsSynchrotron Radiation News, 2015
- Marginal Likelihoods for Distributed Parameter Estimation of Gaussian Graphical ModelsIEEE Transactions on Signal Processing, 2014
- Markov Random Field modeling, inference & learning in computer vision & image understanding: A surveyComputer Vision and Image Understanding, 2013
- Cache-efficient graph cuts on structured grids2012
- Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP2012
- A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-RelabelLecture Notes in Computer Science, 2011
- What energy functions can be minimized via graph cuts?IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- An updated set of basic linear algebra subprograms (BLAS)ACM Transactions on Mathematical Software, 2002