Implementation of a resilient MPI key-value store with redundant copies revealed missing ULFM features for RMA and a workaround, suggesting further simplifications are needed.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Persistent RMA Alltoallv reduces runtime by up to 44% for large messages by amortizing metadata costs, with fence-based designs showing the best gains on a real supercomputer.
citing papers explorer
-
User Experiences with MPI RMA and ULFM in a Resilient Key-Value Store Implementation
Implementation of a resilient MPI key-value store with redundant copies revealed missing ULFM features for RMA and a workaround, suggesting further simplifications are needed.
-
Analyzing Persistent Alltoallv RMA Implementations for High-Performance MPI Communication
Persistent RMA Alltoallv reduces runtime by up to 44% for large messages by amortizing metadata costs, with fence-based designs showing the best gains on a real supercomputer.