5 papers
Promise-Future Synchronization for Cluster Asynchronous Many-Task Runtimes via MPI One-Sided Communication
Mia Reitz
Asynchronous Many-Task (AMT) runtimes use futures as placeholders for values produced by other tasks. In the ItoyoriFBC AMT runtime, the existing future-only model binds each futur…
Protecting Futures against Silent Data Corruption -- Efficient Task Replication for Dynamic Data Dependencies
Rüdiger Nather, Claudia Fohry, Mia Reitz
As the size of computational problems grows, so does the likelihood of Silent Data Corruptions (SDCs). A common defense is replication, where the computation is repeated and correc…
Work Stealing for the 2D-Mesh Topology of Satellite Constellations in Low Earth Orbit
Mia Reitz, Dorian Chenet, Jonas Posner
Asynchronous Many-Task (AMT) is a parallel programming model used in High Performance Computing (HPC). An AMT runtime can distribute fine-grained tasks across processing units call…
Silent Data Corruption Protection through Efficient Task Replication
Mia Reitz, Claudia Fohry
The trend of increasing cluster sizes of supercomputers leads to a growing susceptibility to Silent Data Corruption (SDC) that can invalidate program results. A common strategy for…
Exploring Performance-Productivity Trade-offs in AMT Runtimes: A Task Bench Study of Itoyori, ItoyoriFBC, HPX, and MPI
Torben R. Lahnor, Mia Reitz, Jonas Posner +1
Asynchronous Many-Task (AMT) runtimes offer a productive alternative to the Message Passing Interface (MPI). However, the diverse AMT landscape makes fair comparisons challenging.…