Publication

An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments

Related publications (46)

Graph Chatbot

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.

Medial axis approximation from inner Voronoi balls: A demo of the Mesecina tool

Mark Pauly

We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general approximation method that builds on the same idea, namely, to approximate the ...

2007

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007

Implementing Belief Propagation on P-Grid

Nicolas Bonvin, Damien Auroux, Grégoire Montavon

Some applications require to solve a Bayesian network in a distributed fashion. It can lead to a large amount of messages exchanged between hosts if the variables of the Bayesian network are not allocated to good hosts. The technique we implement uses an a ...

2007

Efficient Peer-to-Peer Belief Propagation

Karl Aberer, Roman Schmidt

In this paper, we will present an efficient approach for distributed inference. We use belief propagation's message-passing algorithm on top of a DHT storing a Bayesian network. Nodes in the DHT run a variant of the spring relaxation algorithm to redistrib ...

2006

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments

Rodrigo Malta Schmidt, Benoît Garbinato, Fernando Pedone

In this paper, we propose a novel approach for solving the reliable broadcast problem in a probabilistic model, i.e., where links lose messages and where processes crash and recover probabilistically. Our approach consists in first defining the optimality ...

2004

The Overhead of Consensus Failure Recovery

Rachid Guerraoui, Partha Dutta

Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free periods, and a slower recovery mode following failures. A lot of work has been devoted to optimizing the normal mode, but little ...

2004

Solving Agreement Problems with Weak Ordering Oracles

André Schiper, David Cavin, Fernando Pedone

Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past y ...

2002

Algorithms and experiments: The new (and the old) methodology

Bernard Moret

The last twenty years have seen enormous progress in the design of algorithms, but little of it has been put into practice. Because many recently developed algorithms are hard to characterize theoretically and have large running_time coefficients, the gap ...

2001

Reliable and Total Order Broadcast in the Crash-Recovery Model

Rachid Guerraoui, Romain Boichat