Scalable Non-Blocking Atomic Snapshot Algorithm in MPI Remote Memory Access Model

This paper describes a scalable, non-blocking method for performing atomic snapshots in a distributed memory system using MPI Remote Memory Access (RMA). The algorithm achieves atomicity through MPI_Compare_and_swap operations, ensuring correctness under concurrent updates. It distributes workload among MPI ranks and avoids locks or global synchronization, enabling high scalability for large datasets and high numbers of processes.The workload is evenly distributed among processes, minimizing contention and achieving linear scalability with increasing dataset size and number of processes.The algorithm's theoretical foundation guarantees atomicity and linearizability, while its design avoids locks and global synchronization, ensuring efficient execution in high-concurrency environments. Experimental evaluation demonstrates its scalability and robustness, with minimal communication overhead even under heavy workloads. This work provides a practical and efficient solution for distributed systems requiring consistent snapshots, contributing to advancements in high-performance computing and large-scale data analytics.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-04-17
DOI
https://doi.org/10.5281/zenodo.15244717
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Non-Blocking Atomic Snapshot Algorithm in MPI Remote Memory Access Model

Zenodo (CERN European Organization for Nuclear Research)
Distributed systems and fault tolerance
article

Scalable Non-Blocking Atomic Snapshot Algorithm in MPI Remote Memory Access Model

article en

Abstract

This paper describes a scalable, non-blocking method for performing atomic snapshots in a distributed memory system using MPI Remote Memory Access (RMA). The algorithm achieves atomicity through MPI_Compare_and_swap operations, ensuring correctness under concurrent updates. It distributes workload among MPI ranks and avoids locks or global synchronization, enabling high scalability for large datasets and high numbers of processes.The workload is evenly distributed among processes, minimizing contention and achieving linear scalability with increasing dataset size and number of processes.The algorithm's theoretical foundation guarantees atomicity and linearizability, while its design avoids locks and global synchronization, ensuring efficient execution in high-concurrency environments. Experimental evaluation demonstrates its scalability and robustness, with minimal communication overhead even under heavy workloads. This work provides a practical and efficient solution for distributed systems requiring consistent snapshots, contributing to advancements in high-performance computing and large-scale data analytics.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 47%
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.