Joseph Schuchart
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Joseph Schuchart has a total of 168 co-authors. Here are the top co-authors by number of shared publications:
Daniel Hackenberg
Technische Universität Dresden
7 shared publicationsWolfgang E. Nagel
Technische Universität Dresden
7 shared publicationsThomas Ilsche
Technische Universität Dresden
6 shared publications- George Bosilca
University of Tennessee, Knoxville, USA
4 shared publications - José Gracia
University of Stuttgart
4 shared publications - Thomas Ilsche
TU Dresden
4 shared publications
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. 161-171
Using C++ Generators in Dataflow Broadcast
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 46 (4) , 73-74
Special Issue on Hot Interconnects 32
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 46 (4) , 73-74
Special Issue on Hot Interconnects 32
- 22 January 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (2) , 133
Constraints and Mutexflows for Scalable Block-Sparse Matrix Multiplication Using Template Task Graphs
- 22 January 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (2) , 133
Constraints and Mutexflows for Scalable Block-Sparse Matrix Multiplication Using Template Task Graphs
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 489-499
On the integration of lightweight tasks with MPI using the C++26 std::execution ‘Senders’ API
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 489-499
Open AccessOn the integration of lightweight tasks with MPI using the C++26 std::execution ‘Senders’ API
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2272-2273
Reproducibility Report for SC25 Paper X-MoE: Enabling Scalable Training for Emerging Mixture-of-Experts Architectures on HPC Platforms
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2272-2273
Open AccessReproducibility Report for SC25 Paper X-MoE: Enabling Scalable Training for Emerging Mixture-of-Experts Architectures on HPC Platforms
- Open Access
- 15 October 2025
- Published by Springer Nature
- p. 165-183
Concepts for Designing Modern C++ Interfaces for MPI
Since the C++ bindings were deleted in 2008, the Message Passing Interface (MPI) community has recently revived efforts in building high-level modern C++ interfaces. Such interfaces are either built to serve specific scientific application needs (with limited coverage to the underlying MPI functionality), or as an exercise in general-purpose programming model building, with the hope that bespoke interfaces can be broadly adopted to construct a variety of distributed-memory scientific applications. However, with the advent of modern C++-based heterogeneous programming models, GPUs and widespread Machine Learning (ML) usage in contemporary scientific computing, the role of prospective community-standardized high-level C++ interfaces to MPI is evolving. The success of such an interface clearly will depend on providing robust abstractions and features adhering to the generic programming principles that underpin the C++ programming language, without compromising on either performance or portability, the core principles upon which MPI was founded. However, there is a tension between idiomatic C++ handling of types and lifetimes and MPI’s loose interpretation of object lifetimes/ownership and insistence on maintaining global states. Instead of proposing “yet another” high-level C++ interface to MPI, overlooking or providing partial solutions to work around the key issues concerning the dissonance between MPI semantics and idiomatic C++, this paper focuses on the three fundamental aspects of a high-level interface: type system, object lifetimes, and communication buffers, while also identifying inconsistencies in the MPI specification. Presumptive solutions can be unrefined, and we hope the broader MPI and C++ communities will engage with us in productive exchange of ideas and concerns.
- 15 October 2025
- Published by Springer Nature
- p. 165-183
Open AccessConcepts for Designing Modern C++ Interfaces for MPI
Since the C++ bindings were deleted in 2008, the Message Passing Interface (MPI) community has recently revived efforts in building high-level modern C++ interfaces. Such interfaces are either built to serve specific scientific application needs (with limited coverage to the underlying MPI functionality), or as an exercise in general-purpose programming model building, with the hope that bespoke interfaces can be broadly adopted to construct a variety of distributed-memory scientific applications. However, with the advent of modern C++-based heterogeneous programming models, GPUs and widespread Machine Learning (ML) usage in contemporary scientific computing, the role of prospective community-standardized high-level C++ interfaces to MPI is evolving. The success of such an interface clearly will depend on providing robust abstractions and features adhering to the generic programming principles that underpin the C++ programming language, without compromising on either performance or portability, the core principles upon which MPI was founded. However, there is a tension between idiomatic C++ handling of types and lifetimes and MPI’s loose interpretation of object lifetimes/ownership and insistence on maintaining global states. Instead of proposing “yet another” high-level C++ interface to MPI, overlooking or providing partial solutions to work around the key issues concerning the dissonance between MPI semantics and idiomatic C++, this paper focuses on the three fundamental aspects of a high-level interface: type system, object lifetimes, and communication buffers, while also identifying inconsistencies in the MPI specification. Presumptive solutions can be unrefined, and we hope the broader MPI and C++ communities will engage with us in productive exchange of ideas and concerns.
- 15 October 2025
- Published by Springer Nature
- p. 73-88
Review of MPI Continuations and Their Integration into PMPI Tools
- 15 October 2025
- Published by Springer Nature
- p. 73-88
Review of MPI Continuations and Their Integration into PMPI Tools
- 1 October 2025
- Published by Springer Nature
- p. 120-132
Scalable Block-Sparse Matrix Multiplication Using Template Task Graphs
- 1 October 2025
- Published by Springer Nature
- p. 120-132
Scalable Block-Sparse Matrix Multiplication Using Template Task Graphs