Alexander Strack
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alexander Strack has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Dirk Pflüger
University of Stuttgart
9 shared publications - Christopher Taylor
Tactical Computing Labs LLC
3 shared publications - Patrick Diehl
Louisiana State University
2 shared publications - Alex Aiken
Stanford University, Stanford, USA
1 shared publication - Aurelien Bouteiller
The University of Tennessee
1 shared publication - Bradford L. Chamberlain
Hewlett Packard Enterprise
1 shared publication
Latest Publications
- Open Access
- 29 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (16) , 1-38
A Survey of Distributed Asynchronous Many-Task Models and Their Applications
Asynchronous many-task (AMT) runtime systems have become an important paradigm for expressing fine-grained parallelism and managing asynchrony in high-performance computing (HPC). Originating from early dataflow concepts, AMTs have evolved to enable dynamic task generation, explicit dependency management, and asynchronous execution, facilitating the overlap of computation and communication. These capabilities address the limitations of traditional bulk-synchronous models, such as those employed in MPI+X , which can struggle with irregular, adaptive, or data-driven workloads. This survey provides a comprehensive overview of representative distributed AMT systems—including Charm ++ , HPX, Legion, PaRSEC, Uintah, Chapel, and StarPU—focusing on their design principles, execution models, and runtime mechanisms for scheduling, communication, and synchronization. We examine how these systems tackle key challenges such as load imbalance, runtime overheads, programmability, and performance portability. In addition, the article discusses application domains where AMTs have demonstrated tangible benefits and highlights the conditions under which their use is most advantageous. The goal of this survey is to equip researchers and practitioners with a clear understanding of distributed AMT models and to provide guidance for selecting and applying the most suitable runtime system for specific computational objectives.
- 29 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (16) , 1-38
Open AccessA Survey of Distributed Asynchronous Many-Task Models and Their Applications
Asynchronous many-task (AMT) runtime systems have become an important paradigm for expressing fine-grained parallelism and managing asynchrony in high-performance computing (HPC). Originating from early dataflow concepts, AMTs have evolved to enable dynamic task generation, explicit dependency management, and asynchronous execution, facilitating the overlap of computation and communication. These capabilities address the limitations of traditional bulk-synchronous models, such as those employed in MPI+X , which can struggle with irregular, adaptive, or data-driven workloads. This survey provides a comprehensive overview of representative distributed AMT systems—including Charm ++ , HPX, Legion, PaRSEC, Uintah, Chapel, and StarPU—focusing on their design principles, execution models, and runtime mechanisms for scheduling, communication, and synchronization. We examine how these systems tackle key challenges such as load imbalance, runtime overheads, programmability, and performance portability. In addition, the article discusses application domains where AMTs have demonstrated tangible benefits and highlights the conditions under which their use is most advantageous. The goal of this survey is to equip researchers and practitioners with a clear understanding of distributed AMT models and to provide guidance for selecting and applying the most suitable runtime system for specific computational objectives.
- 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
- Open Access
GPU-Resident Gaussian Process Regression Leveraging Asynchronous Tasks with HPX
Gaussian processes (GPs) are a widely used regression tool, but the cubic complexity of exact solvers limits their scalability. To address this challenge, we extend the GPRat library by incorporating a fully GPU-resident GP prediction pipeline. GPRat is an HPX-based library that combines task-based parallelism with an intuitive Python API. We implement tiled algorithms for the GP prediction using optimized CUDA libraries, thereby exploiting massive parallelism for linear algebra operations. We evaluate the optimal number of CUDA streams and compare the performance of our GPU implementation to the existing CPU-based implementation. Our results show the GPU implementation provides speedups for datasets larger than 128 training samples. We observe speedups of up to 4.3 for the Cholesky decomposition itself and 4.6 for the GP prediction. Furthermore, combining HPX with multiple CUDA streams allows GPRat to match, and for large datasets, surpass cuSOLVER's performance by up to 11 percent.
Open AccessGPU-Resident Gaussian Process Regression Leveraging Asynchronous Tasks with HPX
Gaussian processes (GPs) are a widely used regression tool, but the cubic complexity of exact solvers limits their scalability. To address this challenge, we extend the GPRat library by incorporating a fully GPU-resident GP prediction pipeline. GPRat is an HPX-based library that combines task-based parallelism with an intuitive Python API. We implement tiled algorithms for the GP prediction using optimized CUDA libraries, thereby exploiting massive parallelism for linear algebra operations. We evaluate the optimal number of CUDA streams and compare the performance of our GPU implementation to the existing CPU-based implementation. Our results show the GPU implementation provides speedups for datasets larger than 128 training samples. We observe speedups of up to 4.3 for the Cholesky decomposition itself and 4.6 for the GP prediction. Furthermore, combining HPX with multiple CUDA streams allows GPRat to match, and for large datasets, surpass cuSOLVER's performance by up to 11 percent.
- 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.
- 30 May 2024
- Published by Springer Nature
- p. 111-122
Experiences Porting Shared and Distributed Applications to Asynchronous Tasks: A Multidimensional FFT Case-Study
- 30 May 2024
- Published by Springer Nature
- p. 111-122
Experiences Porting Shared and Distributed Applications to Asynchronous Tasks: A Multidimensional FFT Case-Study