Technology Category
Constraint Satisfaction and Optimization: Distributed CSP/OptimizationData Mining & Knowledge Management: Scalability, Parallel & Distributed SystemsMachine Learning: Hardware-aware ML
Byzantine-Tolerant Consensus in GPU-Inspired Shared Memory
🤖 AI Summary
Modeling and implementing Byzantine fault-tolerant (BFT) consensus in heterogeneous parallel systems under shared-memory semantics remains challenging, particularly due to the mismatch between conventional synchronization assumptions and GPU-accelerated weak memory consistency.
Method: This work formally integrates GPU-style weak memory semantics into distributed consensus theory—departing from classical synchronous or asynchronous shared-memory models—and designs the first provably correct BFT consensus algorithm for shared memory, guaranteeing deterministic agreement under the optimal resilience condition (n geq 3f + 1).
Contribution/Results: The algorithm achieves (O(n^2)) message complexity—significantly reducing communication overhead compared to classical protocols—while ensuring full safety and liveness. Its correctness is rigorously verified using TLA+. The key innovation lies in establishing a GPU-inspired shared-memory model that jointly optimizes fault tolerance and high-concurrency efficiency.
Technology Category
Application Category
📝 Abstract
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.
Problem
Research questions and friction points this paper is trying to address.
Formalize GPU-inspired shared memory model
Solve Byzantine Consensus problem
Develop algorithmic solutions within model
Innovation
Methods, ideas, or system contributions that make the work stand out.
GPU-inspired shared memory model
Byzantine Consensus problem solutions
Algorithmic development in shared memory
🔎 Similar Papers
2023-02-05arXiv.orgCitations: 5
💼 Related Jobs
