Scaling atomic ordering in shared memory
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918138212253696 |
|---|---|
| author | Martignetti, Lorenzo Batista, Eliã Cugola, Gianpaolo Pedone, Fernando |
| author_facet | Martignetti, Lorenzo Batista, Eliã Cugola, Gianpaolo Pedone, Fernando |
| contents | Atomic multicast is a communication primitive used in dependable systems to ensure consistent ordering of messages delivered to a set of replica groups. This primitive enables critical services to integrate replication and sharding (i.e., state partitioning) to achieve fault tolerance and scalability. While several atomic multicast protocols have been developed for message-passing systems, only a few are designed for the shared memory system model. This paper introduces TRAM, an atomic multicast protocol specifically designed for shared memory systems, leveraging an overlay tree architecture. Due to its simple and practical design, TRAM delivers exceptional performance, increasing throughput by more than 3$\times$ and reducing latency by more than 2.3$\times$ compared to state-of-the-art shared memory-based protocols. Additionally, it significantly outperforms message-passing-based protocols, boosting throughput by up to 5.9$\times$ and reducing latency by up to 106$\times$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_07781 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Scaling atomic ordering in shared memory Martignetti, Lorenzo Batista, Eliã Cugola, Gianpaolo Pedone, Fernando Distributed, Parallel, and Cluster Computing Atomic multicast is a communication primitive used in dependable systems to ensure consistent ordering of messages delivered to a set of replica groups. This primitive enables critical services to integrate replication and sharding (i.e., state partitioning) to achieve fault tolerance and scalability. While several atomic multicast protocols have been developed for message-passing systems, only a few are designed for the shared memory system model. This paper introduces TRAM, an atomic multicast protocol specifically designed for shared memory systems, leveraging an overlay tree architecture. Due to its simple and practical design, TRAM delivers exceptional performance, increasing throughput by more than 3$\times$ and reducing latency by more than 2.3$\times$ compared to state-of-the-art shared memory-based protocols. Additionally, it significantly outperforms message-passing-based protocols, boosting throughput by up to 5.9$\times$ and reducing latency by up to 106$\times$. |
| title | Scaling atomic ordering in shared memory |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2509.07781 |