The Heard-Of model: computing in distributed systems with benign faults

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Theoretical and computational approaches to the study of materials and molecules have, over the last few decades, progressed at an exponential rate. Yet, the possibility of producing numerical predictions that are on par with experimental measurements is t ...

This paper introduces a new method for solving the distributed AC power flow (PF) problem by further exploiting the problem formulation. We propose a new variant of the ALADIN algorithm devised specifically for this type of problem. This new variant is cha ...

Centralized and cloud computing-based network architectures are the promising tracks of future communication systems where a large scale compute power can be virtualized for various algorithms. These architectures rely on high-performance communication lin ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

Policymaking is a complex process that has been studied using policy process theories almost exclusively. These theories have been built using a large number of qualitative cases. Such methods are useful for theory building but remain limited for theory ex ...

As the volume of produced data is exponentially increasing, companies tend to rely on distributed systems to meet the surging demand for storage capacity. With the business workflows becoming more and more complex, such systems often consist of or are acce ...

The field of distributed computing has a long history, of more than fifty years. During that time, our understanding of the field has improved immensely and a certain body of folklore beliefs has formed. However, such folklore beliefs are not necessarily a ...

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. The invention proposes an approach to simplify asynchronous consensus by building it atop a novel threshold logic ...

In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

This dataset includes the parallel application and the main results supporting the research article "Modeling snow saltation: the effect of grain size and interparticle cohesion" published at the Journal of Geophysical Research: Atmospheres.The code is a f ...

Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on device-to-device (D2D) ecosystems (e.g., crowdsensing). More sophisticated applications, like cryptocurrencies, need ...

The Heard-Of model: computing in distributed systems with benign faults

Chat with Graph Search

Physics-enhanced machine learning with symmetry-adapted and long-range representations

Rapid Scalable Distributed Power Flow with Open-Source Implementation

Modified Joint Channel-and-Data Estimation for One-Bit Massive MIMO

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Exploring policy change through agent-based simulation

Clouseau: Blockchain-based Data Integrity for HDFS Clusters

The Hidden Complexity of Distributed Systems

Asynchronous distributed coordination and consensus with threshold logical clocks

Distributed Computing with Modern Shared Memory

Dynamic Byzantine Reliable Broadcast

Modeling snow saltation: the effect of grain size and interparticle cohesion

Mneme: A Mobile Distributed Ledger