Publication

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

Publications associées (303)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

User-level Internet tomography and overlay routing

Xuan Hung Nguyen

In this thesis, we study methods to detect, localize and overcome performance problems experienced by end-users in communication networks. These problems are extremely difficult to solve when the only available information are end-to-end data. We first con ...

EPFL2008

Reconfigurable Distributed Storage for Dynamic Networks

Vincent Gramoli, Seth Gilbert

This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures ...

2008

A Statistical Analysis of Certain Iterative Learning Control Algorithms

Alireza Karimi, Roland Longchamp, Mark Edward John Butcher

Iterative Learning Control (ILC) is a technique used to improve the tracking performance of systems carrying out repetitive tasks, which are affected by deterministic disturbances. The achievable performance is greatly degraded, however, when non-repeating ...

2008

Optimistic Erasure-Coded Distributed Storage

Rachid Guerraoui, Ron Levy, Partha Dutta

We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic ...

2008

Survey Propagation Inspired Algorithms for Satisfiability

Nicolas Macris, Shrinivas Kudekar

In this note we develop generalized Survey Propagation (SP) equations from the cavity method. We quantize the message space of the messages to develop a message passing rule. We investigate a framework of greedy algorithms for finding out satisfying assign ...

2008

Balanced relay allocation on heterogeneous unstructured overlays

Patrick Thiran, Matthias Grossglauser, Xuan Hung Nguyen

Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently, adopted proposal to mitigate this problem is to use relay nodes, end-hosts that act as ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Steady-state performance of incremental learning over distributed networks for non-Gaussian data

Ali H. Sayed

In this paper, the steady-state performance of the distributed least mean-squares (dLMS) algorithm within an incremental network is evaluated without the restriction of Gaussian distributed inputs. Computer simulations are presented to verify the derived p ...

IEEE2008

On the Complexity of Asynchronous Gossip

Rachid Guerraoui, Seth Gilbert

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the ...

2008

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Martin Vetterli, Patrick Thiran, Florence Bénézit, Patrick Denantes

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Institute of Electrical and Electronics Engineers2008

Atomic broadcast

Nils Richard Ekwall

Within only a couple of generations, the so-called digital revolution has taken the world by storm: today, almost all human beings interact, directly or indirectly, at some point in their life, with a computer system. Computers are present on our desks, co ...

EPFL2007