Improving Fast Paxos: being optimistic with no overhead

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.

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

Displaced communication, whereby individuals communicate regarding a subject that is not immediately present (spatially or temporally), is one of the key features of human language. It also occurs in a few animal species, most notably the honeybee, where t ...

Humans can express their actions and intentions, resorting to verbal and/or non-verbal communication. In verbal communication, humans use language to express, in structured linguistic terms, the desired action they wish to perform. Non-verbal communication ...

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

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 ...

Contact tracing is an essential tool to mitigate the impact of a pandemic, such as the COVID-19 pandemic. In order to achieve efficient and scalable contact tracing in real time, digital devices can play an important role. While a lot of attention has been ...

We consider the problem of making apps fault-tolerant through replication, when apps operate at the microsecond scale, as in finance, embedded computing, and microservices apps. These apps need a replication scheme that also operates at the microsecond sca ...

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 ...

We study the problem of distributed estimation over adaptive networks where communication delays exist between nodes. In particular, we investigate the diffusion Least-Mean-Square (LMS) strategy where delayed intermediate estimates (due to the communicatio ...

SBFT is a state of the art Byzantine fault tolerant state machine replication system that addresses the challenges of scalability, decentralization and global geo-replication. SBFT is optimized for decentralization and is experimentally evaluated on a depl ...

Modern asynchronous runtime systems allow the re-thinking of large-scale scientific applications. With the example of a simulator of morphologically detailed neural networks, we show how detaching from the commonly used bulk-synchronous parallel (BSP) exec ...

Synchronous mini-batch SGD is state-of-the-art for large-scale distributed machine learning. However, in practice, its convergence is bottlenecked by slow communication rounds between worker nodes. A natural solution to reduce communication is to use the " ...

Problems of pattern formation have been extensively studied in distributed computing. One of this problems is the gathering problem: agents must gather at a same position in a distributed manner. When gathering is not possible, a close problem is the conve ...

In this paper a hybrid framework is illustrated, with a software and hardware integration strategy, for an industrial platform that exploits features from a Relational Database (RDB) and Triplestore using the blackboard architectural pattern, ensuring effi ...

Economic growth is increasingly explained and driven by knowledge acquisition and firmsâ capabilities to adapt to new evolving situations to fit economic, societal and environmental frames. Strategic behavior of private companies in differentiating and p ...

Distributed graph signal processing algorithms require the network nodes to communicate by exchanging messages in order to achieve a common objective. These messages have a finite precision in realistic networks, which may necessitate to implement message ...

Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...

Improving Fast Paxos: being optimistic with no overhead

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Hypergraph-Based Fast Distributed AC Power Flow Optimization

The evolution of behavioral cues and signaling in displaced communication

Non-verbal Communication between Humans and Robots: Imitation, Mutual Understanding and Inferring Object Properties

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

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

Epidemic mitigation by statistical inference from contact tracing data

Microsecond Consensus for Microsecond Applications

The Hidden Complexity of Distributed Systems

Diffusion LMS With Communication Delays: Stability and Performance Analysis

SBFT: a Scalable and Decentralized Trust Infrastructure

Fully-Asynchronous Cache-Efficient Simulation of Detailed Neural Networks

Communication trade-offs for Local-SGD with large step size

Exploring The Borderlands Of The Gathering Problem

A hybrid framework for industrial data storage and exploitation

Innovation capacity of the agricultural sector: network of productive interactions, knowledge transfer and differentiation mechanisms

Optimized Quantization in Distributed Graph Signal Filtering

Causal Consistency and Latency Optimality: Friend or Foe? [Extended Version]

Causal Consistency and Latency Optimality: Friend or Foe?