Dirk Pflüger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Dirk Pflüger has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Strack
University of Stuttgart
9 shared publications - Gregor Daiß
IPVS University of Stuttgart 70174 Stuttgart Stuttgart Germany
8 shared publications - Patrick Diehl
Louisiana State University
8 shared publications - Hartmut Kaiser
Louisiana State University
6 shared publications - Alexander Van Craen
University of Stuttgart, Scientific Computing, Stuttgart, Germany
5 shared publications - Sagiv Shiber
Florida State University
5 shared publications
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 27-39
GPU-Resident Gaussian Process Regression Leveraging Asynchronous Tasks with HPX
- 2 July 2026
- Published by Springer Nature
- p. 27-39
GPU-Resident Gaussian Process Regression Leveraging Asynchronous Tasks with HPX
- 2 July 2026
- Published by Springer Nature
- p. 15-26
From Prompts to Performance: Evaluating LLMs for Task-Based Parallel Code Generation
- 2 July 2026
- Published by Springer Nature
- p. 15-26
From Prompts to Performance: Evaluating LLMs for Task-Based Parallel Code Generation
- Open Access
- 6 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Comparing the Performance of Heterogeneous Conjugate Gradient and Cholesky Solvers on Various Hardware Using SYCL
- 6 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessComparing the Performance of Heterogeneous Conjugate Gradient and Cholesky Solvers on Various Hardware Using SYCL
- 24 November 2025
- Published by Springer Nature
- p. 586-597
Parallel FFTW on RISC-V: A Comparative Study Including OpenMP, MPI, and HPX
- 24 November 2025
- Published by Springer Nature
- p. 586-597
Parallel FFTW on RISC-V: A Comparative Study Including OpenMP, MPI, and HPX
- 1 October 2025
- Published by Springer Nature
- p. 83-94
GPRat: Gaussian Process Regression with Asynchronous Tasks
- 1 October 2025
- Published by Springer Nature
- p. 83-94
GPRat: Gaussian Process Regression with Asynchronous Tasks
- 10 June 2025
- Published by Springer Nature
- p. 271-274
A HPX Communication Benchmark: Distributed FFT Using Collectives
- 10 June 2025
- Published by Springer Nature
- p. 271-274
A HPX Communication Benchmark: Distributed FFT Using Collectives
- Open Access
Parallel FFTW on RISC-V: A Comparative Study including OpenMP, MPI, and HPX
Rapid advancements in RISC-V hardware development shift the focus from low-level optimizations to higher-level parallelization. Recent RISC-V processors, such as the SOPHON SG2042, have 64 cores. RISC-V processors with core counts comparable to the SG2042, make efficient parallelization as crucial for RISC-V as the more established processors such as x86-64. In this work, we evaluate the parallel scaling of the widely used FFTW library on RISC-V for MPI and OpenMP. We compare it to a 64-core AMD EPYC 7742 CPU side by side for different types of FFTW planning. Additionally, we investigate the effect of memory optimization on RISC-V in HPX-FFT, a parallel FFT library based on the asynchronous many-task runtime HPX using an FFTW backend. We generally observe a performance delta between the x86-64 and RISC-V chips of factor eight for double-precision 2D FFT. Effective memory optimizations in HPX-FFT on x86-64 do not translate to the RISC-V chip. FFTW with MPI shows good scaling up to 64 cores on x86-64 and RISC-V regardless of planning. In contrast, FFTW with OpenMP requires measured planning on both architectures to achieve good scaling up to 64 cores. The results of our study mark an early step on the journey to large-scale parallel applications running on RISC-V.
Open AccessParallel FFTW on RISC-V: A Comparative Study including OpenMP, MPI, and HPX
Rapid advancements in RISC-V hardware development shift the focus from low-level optimizations to higher-level parallelization. Recent RISC-V processors, such as the SOPHON SG2042, have 64 cores. RISC-V processors with core counts comparable to the SG2042, make efficient parallelization as crucial for RISC-V as the more established processors such as x86-64. In this work, we evaluate the parallel scaling of the widely used FFTW library on RISC-V for MPI and OpenMP. We compare it to a 64-core AMD EPYC 7742 CPU side by side for different types of FFTW planning. Additionally, we investigate the effect of memory optimization on RISC-V in HPX-FFT, a parallel FFT library based on the asynchronous many-task runtime HPX using an FFTW backend. We generally observe a performance delta between the x86-64 and RISC-V chips of factor eight for double-precision 2D FFT. Effective memory optimizations in HPX-FFT on x86-64 do not translate to the RISC-V chip. FFTW with MPI shows good scaling up to 64 cores on x86-64 and RISC-V regardless of planning. In contrast, FFTW with OpenMP requires measured planning on both architectures to achieve good scaling up to 64 cores. The results of our study mark an early step on the journey to large-scale parallel applications running on RISC-V.
- Open Access
GPRat: Gaussian Process Regression with Asynchronous Tasks
Python is the de-facto language for software development in artificial intelligence (AI). Commonly used libraries, such as PyTorch and TensorFlow, rely on parallelization built into their BLAS backends to achieve speedup on CPUs. However, only applying parallelization in a low-level backend can lead to performance and scaling degradation. In this work, we present a novel way of binding task-based C++ code built on the asynchronous runtime model HPX to a high-level Python API using pybind11. We develop a parallel Gaussian process (GP) li- brary as an application. The resulting Python library GPRat combines the ease of use of commonly available GP libraries with the performance and scalability of asynchronous runtime systems. We evaluate the per- formance on a mass-spring-damper system, a standard benchmark from control theory, for varying numbers of regressors (features). The results show almost no binding overhead when binding the asynchronous HPX code using pybind11. Compared to GPyTorch and GPflow, GPRat shows superior scaling on up to 64 cores on an AMD EPYC 7742 CPU for train- ing. Furthermore, our library achieves a prediction speedup of 7.63 over GPyTorch and 25.25 over GPflow. If we increase the number of features from eight to 128, we observe speedups of 29.62 and 21.19, respectively. These results showcase the potential of using asynchronous tasks within Python-based AI applications.
Open AccessGPRat: Gaussian Process Regression with Asynchronous Tasks
Python is the de-facto language for software development in artificial intelligence (AI). Commonly used libraries, such as PyTorch and TensorFlow, rely on parallelization built into their BLAS backends to achieve speedup on CPUs. However, only applying parallelization in a low-level backend can lead to performance and scaling degradation. In this work, we present a novel way of binding task-based C++ code built on the asynchronous runtime model HPX to a high-level Python API using pybind11. We develop a parallel Gaussian process (GP) li- brary as an application. The resulting Python library GPRat combines the ease of use of commonly available GP libraries with the performance and scalability of asynchronous runtime systems. We evaluate the per- formance on a mass-spring-damper system, a standard benchmark from control theory, for varying numbers of regressors (features). The results show almost no binding overhead when binding the asynchronous HPX code using pybind11. Compared to GPyTorch and GPflow, GPRat shows superior scaling on up to 64 cores on an AMD EPYC 7742 CPU for train- ing. Furthermore, our library achieves a prediction speedup of 7.63 over GPyTorch and 25.25 over GPflow. If we increase the number of features from eight to 128, we observe speedups of 29.62 and 21.19, respectively. These results showcase the potential of using asynchronous tasks within Python-based AI applications.
- Open Access
- 26 February 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (106) , 7018
DisCoTec: Distributed higher-dimensional HPC simulations with the sparse grid combination technique
DisCoTec is a C++ framework for the sparse grid combination technique (Griebel et al., 1992), designed for massively parallel settings. It is implemented with shared-memory parallelism via OpenMP and distributed-memory parallelism via MPI, and is intended to be used in conjunction with existing simulation codes. For simulation codes that can handle nested structured grids, little to no adaptation work is needed for use with the DisCoTec framework. The combination technique with DisCoTec demonstrates its superiority in precision-per-memory for higher-dimensional time-dependent simulations, such as high-fidelity plasma turbulence simulations in four to six dimensions and even for simulations in two dimensions, improvements can be observed (Pollinger et al., 2023).
- 26 February 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (106) , 7018
Open AccessDisCoTec: Distributed higher-dimensional HPC simulations with the sparse grid combination technique
DisCoTec is a C++ framework for the sparse grid combination technique (Griebel et al., 1992), designed for massively parallel settings. It is implemented with shared-memory parallelism via OpenMP and distributed-memory parallelism via MPI, and is intended to be used in conjunction with existing simulation codes. For simulation codes that can handle nested structured grids, little to no adaptation work is needed for use with the DisCoTec framework. The combination technique with DisCoTec demonstrates its superiority in precision-per-memory for higher-dimensional time-dependent simulations, such as high-fidelity plasma turbulence simulations in four to six dimensions and even for simulations in two dimensions, improvements can be observed (Pollinger et al., 2023).
- 17 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-17
Realizing Joint Extreme-Scale Simulations on Multiple Supercomputers—Two Superfacility Case Studies
High-dimensional grid-based simulations serve as both a tool and a challenge in researching various domains. The main challenge of these approaches is the well-known curse of dimensionality, amplified by the need for fine resolutions in high-fidelity applications. The combination technique (CT) provides a straightforward way of performing such simulations while alleviating the curse of dimensionality. Recent work demonstrated the potential of the CT to join multiple systems simultaneously to perform a single high-dimensional simulation. This paper shows how to extend this to three or more systems and addresses some remaining challenges: load balancing on heterogeneous hardware; utilizing compression to maximize the communication bandwidth; efficient I/O management through hardware mapping; and improving memory utilization through algorithmic optimizations. Combining these contributions, we demonstrate the feasibility of the CT for extreme-scale Superfacility scenarios of 46 trillion DOF on two systems and 35 trillion DOF on three systems. Scenarios at these resolutions would be intractable with full-grid solvers ($\gt1,000$ nonillion DOF each).
- 17 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-17
Realizing Joint Extreme-Scale Simulations on Multiple Supercomputers—Two Superfacility Case Studies
High-dimensional grid-based simulations serve as both a tool and a challenge in researching various domains. The main challenge of these approaches is the well-known curse of dimensionality, amplified by the need for fine resolutions in high-fidelity applications. The combination technique (CT) provides a straightforward way of performing such simulations while alleviating the curse of dimensionality. Recent work demonstrated the potential of the CT to join multiple systems simultaneously to perform a single high-dimensional simulation. This paper shows how to extend this to three or more systems and addresses some remaining challenges: load balancing on heterogeneous hardware; utilizing compression to maximize the communication bandwidth; efficient I/O management through hardware mapping; and improving memory utilization through algorithmic optimizations. Combining these contributions, we demonstrate the feasibility of the CT for extreme-scale Superfacility scenarios of 46 trillion DOF on two systems and 35 trillion DOF on three systems. Scenarios at these resolutions would be intractable with full-grid solvers ($\gt1,000$ nonillion DOF each).