Publications related to Distributed algorithm

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Colin Neil Jones, Yuning Jiang, Yingzhao Lian, Xinliang Dai

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

New York2023

Hybrid Flock - Formation Control Algorithms

Alcherio Martinoli, Cyrill Silvan Baumann, Jonas Perolini, Emna Tourki

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

2022

The Price of Distributed: Rate Loss in the CEO Problem

Michael Christoph Gastpar, Alper Köse, Ahmet Arda Atalik

In the distributed remote (CEO) source coding problem, many separate encoders observe independently noisy copies of an underlying source. The rate loss is the difference between the rate required in this distributed setting and the rate that would be requi ...

2022

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

2022

Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use

Rachid Guerraoui, Jovan Komatovic, Zarko Milosevic, Dragos-Adrian Seredinschi

Tendermint is a deterministic consensus protocol and is one of the most mature implementations of its kind. This implementation is used as the core for building State Machine Replication (SMR) platforms with Byzantine fault-tolerant (BFT) guarantees. A not ...

IEEE2022

Dynamic Byzantine Reliable Broadcast

Rachid Guerraoui, Jovan Komatovic, Dragos-Adrian Seredinschi, Andrei Tonkikh

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

Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021

Microsecond Consensus for Microsecond Applications

Rachid Guerraoui, Mihail Igor Zablotchi, Athanasios Xygkis, Naama Ben David

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

USENIX ASSOC2020

Distributed Coloring of Graphs with an Optimal Number of Colors

Etienne Michel François Bamas

This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e. with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on ...

SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS2019

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.

Distributed algorithm

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Hybrid Flock - Formation Control Algorithms

The Price of Distributed: Rate Loss in the CEO Problem

The Universal Gossip Fighter

Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use

Dynamic Byzantine Reliable Broadcast

Microsecond Consensus for Microsecond Applications

The Hidden Complexity of Distributed Systems

Learning the Globally Optimal Distributed LQ Regulator

Distributed Coloring of Graphs with an Optimal Number of Colors

Graph Chatbot

Chat with Graph Search

Hypergraph-Based Fast Distributed AC Power Flow Optimization

The Universal Gossip Fighter

The Hidden Complexity of Distributed Systems

Learning the Globally Optimal Distributed LQ Regulator

Dynamic Byzantine Reliable Broadcast

Hybrid Flock - Formation Control Algorithms

The Price of Distributed: Rate Loss in the CEO Problem

Microsecond Consensus for Microsecond Applications

Distributed Coloring of Graphs with an Optimal Number of Colors

Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use