Cover Image

Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kshemkalyani, Ajay D., Piduguralla, Manaswini, Peri, Sathya, Misra, Anshuman
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms C.2.4; D.1.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Byzantine-Tolerant Consensus in GPU-Inspired Shared Memory
by: Georgiou, Chryssis, et al.
Published: (2025)

Byzantine Fault Tolerant Causal Ordering
by: Misra, Anshuman, et al.
Published: (2021)

Big Atomics
by: Anderson, Daniel, et al.
Published: (2025)

Auditable Shared Objects: From Registers to Synchronization Primitives
by: Attiya, Hagit, et al.
Published: (2025)

Strong Linearizability without Compare&Swap: The Case of Bags
by: Ellen, Faith, et al.
Published: (2024)

Agent-based Leader Election, MST, and Beyond
by: Kshemkalyani, Ajay D., et al.
Published: (2024)

Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)

BlockRaFT: A Distributed Framework for Fault-Tolerant and Scalable Blockchain Nodes
by: Piduguralla, Manaswini, et al.
Published: (2026)

Unleashing Multicore Strength for Efficient Execution of Transactions
by: Ravish, Ankit, et al.
Published: (2024)

Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
by: Almeida, Paulo Sérgio, et al.
Published: (2024)

Dependency-Aware Execution Mechanism in Hyperledger Fabric Architecture
by: Kaul, Sanyam, et al.
Published: (2025)

Scalable Concurrent Queues for GPU
by: Shetty, Pratheek Prakash, et al.
Published: (2026)

How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
by: von Geijer, Kåre, et al.
Published: (2024)

ConflictSync: Bandwidth Efficient Synchronization of Divergent State
by: Gomes, Pedro Silva, et al.
Published: (2025)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
by: Karmegam, Arivarasan, et al.
Published: (2026)

Shipwright: Proving liveness of distributed systems with Byzantine participants
by: Leung, Derek, et al.
Published: (2025)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)

Regular mixed-radix DFT matrix factorization for in-place FFT accelerators
by: Salishev, Sergey
Published: (2025)

Fault-Tolerant Decentralized Distributed Asynchronous Federated Learning with Adaptive Termination Detection
by: Akkinepally, Phani Sahasra, et al.
Published: (2025)

Towards Stronger Blockchains: Security Against Front-Running Attacks
by: Misra, Anshuman, et al.
Published: (2023)

Communication Requirements for Linearizable Registers
by: Nataf, Raïssa, et al.
Published: (2026)

Rhizomes and Diffusions for Processing Highly Skewed Graphs on Fine-Grain Message-Driven Systems
by: Chandio, Bibrak Qamar, et al.
Published: (2024)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
by: Bonomi, Silvia, et al.
Published: (2021)

Safe Memory Reclamation Techniques
by: Singh, Ajay
Published: (2025)

Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance
by: Antunes, Diogo S., et al.
Published: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)