15 citations · 25 across the 8 of their papers we have counts for
8 papers
Bizur: A Key-value Consensus Algorithm for Scalable File-systems
Ezra N. Hoch, Yaniv Ben-Yehuda, Noam Lewis +1
Bizur is a consensus algorithm exposing a key-value interface. It is used by a distributed file-system that scales to 100s of servers, delivering millions of IOPS, both data and me…
A Fault-Resistant Asynchronous Clock Function
Ezra N. Hoch, Michael Ben-Or, Danny Dolev
Consider an asynchronous network in a shared-memory environment consisting of n nodes. Assume that up to f of the nodes might be Byzantine (n > 12f), where the adversary is full-in…
Simple Gradecast Based Algorithms
Michael Ben-Or, Danny Dolev, Ezra N. Hoch
Gradecast is a simple three-round algorithm presented by Feldman and Micali. The current work presents a very simple algorithm that utilized Gradecast to achieve Byzantine agreemen…
An Optimal Self-Stabilizing Firing Squad
Danny Dolev, Ezra N. Hoch, Yoram Moses
Consider a fully connected network where up to processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of…
A Statistical Approach to Performance Monitoring in Soft Real-Time Distributed Systems
Danny Bickson, Gidon Gershinsky, Ezra N. Hoch +1
Soft real-time applications require timely delivery of messages conforming to the soft real-time constraints. Satisfying such requirements is a complex task both due to the volatil…
Self-stabilizing Numerical Iterative Computation
Danny Bickson, Ezra N. Hoch, Harel Avissar +1
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal process…