Asynchronous Many-Task Systems and Applications

.- Speaking Pygion: Experiences Writing an Exascale Single Particle Imaging Code.
.- Futures for dynamic dependencies - Parallelizing the H-LU Factorization.
.- Evaluating PaRSEC through Matrix Computations in Scientific Applications.
.- Distributed Asynchronous Contact Mechanics with DARMA/vt.
.- IRIS Reimagined: Advancements in Intelligent Runtime System for Task Based Programming.
.- MatRIS: Addressing the Challenges for Portability and Heterogeneity using Tasking for Matrix Decomposition (Cholesky).
.- ParSweet: A Suite of Codes for Benchmarking and Testing Mutex-Based Parallel Systems.
.- Rethinking Programming Paradigms in the QC-HPC Context.
.- Dynamic Tuning of Core Counts to Maximize Performance in Object-based Runtime Systems.
.- Enhancing sparse direct solver scalability through runtime system automatic data partition.
.- Experiences Porting Shared and Distributed Applications to Asynchronous Tasks: A Multidimensional FFT Case-study.
.- An abstraction for distributed stencil computations using Charm++.
.- DLA-Future: a task-based linear algebra library which provides a GPU enabled distributed eigensolver.
.- ALPI: Enhancing Portability and Interoperability of Task-Aware Libraries.
.- Evolving APGAS Programs: Automatic and Transparent Resource Adjustments at Runtime.
.- Optimizing Parallel System Efficiency: Dynamic Task Graph Adaptation with Recursive Tasks.
.- HPX with Spack and Singularity Containers: Evaluating Overheads for HPX/Kokkos using an astrophysics application.