3 citations · 7 across the 9 of their papers we have counts for
12 papers · 1 filter
Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
Alejandro Naser-Pastoriza, Gregory Chockler, Alexey Gotsman +1
Communication channel failures are a major concern for the developers of modern fault-tolerant systems. However, while tight bounds for process failures are well-established, exten…
Vertical Atomic Broadcast and Passive Replication (Extended Version)
Manuel Bravo, Gregory Chockler, Alexey Gotsman +2
Atomic broadcast is a reliable communication abstraction ensuring that all processes deliver the same set of messages in a common global order. It is a fundamental building block f…
Fault-Tolerant Computing with Unreliable Channels (Extended Version)
Alejandro Naser-Pastoriza, Gregory Chockler, Alexey Gotsman
We study implementations of basic fault-tolerant primitives, such as consensus and registers, in message-passing systems subject to process crashes and a broad range of communicati…
Liveness and Latency of Byzantine State-Machine Replication (Extended Version)
Manuel Bravo, Gregory Chockler, Alexey Gotsman
Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technolog…
Making Byzantine Consensus Live (Extended Version)
Manuel Bravo, Gregory Chockler, Alexey Gotsman
Partially synchronous Byzantine consensus protocols typically structure their execution into a sequence of views, each with a designated leader process. The key to guaranteeing liv…
White-Box Atomic Multicast (Extended Version)
Alexey Gotsman, Anatole Lefort, Gregory Chockler
Atomic multicast is a communication primitive that delivers messages to multiple groups of processes according to some total order, with each group receiving the projection of the…
Multi-Shot Distributed Transaction Commit (Extended Version)
Gregory Chockler, Alexey Gotsman
Atomic Commit Problem (ACP) is a single-shot agreement problem similar to consensus, meant to model the properties of transaction commit protocols in fault-prone distributed system…
Space Complexity of Fault Tolerant Register Emulations
Gregory Chockler, Alexander Spiegelman
Driven by the rising popularity of cloud storage, the costs associated with implementing reliable storage services from a collection of fault-prone servers have recently become an…
FRAPPE: Fast Replication Platform for Elastic Services
Vita Bortnikov, Gregory Chockler, Dmitri Perelman +3
Elasticity is critical for today's cloud services, which must be able to quickly adapt to dynamically changing load conditions and resource availability. We introduce FRAPPE, a new…
Reconfigurable State Machine Replication from Non-Reconfigurable Building Blocks
Vita Bortnikov, Gregory Chockler, Dmitri Perelman +3
Reconfigurable state machine replication is an important enabler of elasticity for replicated cloud services, which must be able to dynamically adjust their size as a function of c…
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives
Gregory Chockler, Dan Dobre, Alexander Shraer +1
Reliable storage emulations from fault-prone components have established themselves as an algorithmic foundation of modern storage services and applications. Most existing reliable…
Space Bounds for Reliable Storage: Fundamental Limits of Coding
Alexander Spiegelman, Yuval Cassuto, Gregory Chockler +1
We study the inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-k…