Score: 0
Byzantine-Tolerant Consensus in GPU-Inspired Shared Memory
Published: March 17, 2025 |
arXiv ID: 2503.12788v3
By: Chryssis Georgiou, Manaswini Piduguralla, Sathya Peri
Potential Business Impact:
Lets computers agree even if some are broken.
Business Areas:
GPU
Hardware
In this work, we formalize a novel shared memory model inspired by the popular GPU architecture. Within this model, we develop algorithmic solutions to the Byzantine Consensus problem and analyze their fault-resilience.
Similar Papers
88%
Two-Fold Byzantine Fault Tolerance Algorithm: Byzantine Consensus in Blockchain
Distributed, Parallel, and Cluster Computing
Finds bad guys in computer networks.
22 Apr 2025
1
86%
Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
Distributed, Parallel, and Cluster Computing
Keeps computer groups honest even with glitches.
15 Jun 2025
1
86%
Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
Distributed, Parallel, and Cluster Computing
Helps computers agree even with some broken.
5 Aug 2025
0
Country of Origin
🇨🇾
Cyprus
Page Count
19 pages
Category
Computer Science:
Distributed, Parallel, and Cluster Computing