Publication

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Related publications (303)

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.

Adaptive Highways on a Grid

Raffaello D'Andrea, Hajir Roozbehani

The primary objective of this paper is to introduce the adaptive highways algorithm, a path planning algorithm for vehicles moving on a grid. We consider a workspace that consists of a symmetric grid and a large number of vehicles that move on the grid to ...

Springer-Verlag Berlin2011

Modeling Bird Flight Formations Using Diffusion Adaptation

Ali H. Sayed

Flocks of birds self-organize into V-formations when they need to travel long distances. It has been shown that this formation allows the birds to save energy, by taking advantage of the upwash generated by the neighboring birds. In this work we use a mode ...

IEEE2011

A Fault-Tolerant Token based Atomic Broadcast Algorithm

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last twenty years. Token based algorithms represent a large class of these algorithms. Interestingly, all the token based atomic broadcast algorithms rely on a group membership service and none of ...

2010

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for the algorithms we analyzed, in most cases, the decentralized variant ...

2010

Systematic correct construction of self-stabilizing systems: A case study

Joseph Sifakis

Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanticipated physical events such as faults. Thus, constructing correct distribut ...

2010

PaxosInside

Rachid Guerraoui, Maysam Yabandeh

Amodernmanycore architecture can be viewed as a distributed system with explicit message passing to communicate between cores. Ensuring the consistency of shared state replicated over several cores is the key to the well functioning of such a system. Yet, ...

2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an in- creasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural ex- tension of the random phone-call ...

Springer2010

Diffusion LMS Strategies for Distributed Estimation

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes is required to collectively estimate some parameter of interest from noisy measurements. The problem is useful in several contexts including wireless and sensor networks, where scalabi ...

IEEE2010

Generic construction of consensus algorithms for benign and Byzantine faults

André Schiper, Zarko Milosevic, Olivier Rütti

The paper proposes a generic consensus algorithm that highlights the basic and common features of known consensus algorithms. The parameters of the generic algorithm encapsulate the core differences between various consensus algorithms, including leader-ba ...

2010

In search of lost time

Martin Hutle

Dwork, Lynch, and Stockmeyer [3] and Lamport [4] showed that, in order to solve Consensus in a distributed system, it is sufficient that the system behaves well during a finite period of time. In sharp contrast, Chandra. Hadzilacos, and Toueg [6] proved th ...

2010