Publication

The Heard-Of model: computing in distributed systems with benign faults

Publications associées (54)

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

Scalable Monitoring of Interconnected Stochastic Systems

Giancarlo Ferrari Trecate, Marcello Farina

In this paper, we propose a novel distributed fault detection method to monitor the state of a linear system, partitioned into interconnected subsystems. The approach hinges on the definition of a partition-based distributed Luenberger estimator, based on ...

2016

A Plug-and-Play fault diagnosis approach for large-scale systems

Giancarlo Ferrari Trecate

This paper proposes a novel Plug-and-Play (PnP) dynamic approach for the monitoring of Large-Scale Systems (LSSs). The proposed architecture exploits a distributed Fault Detection and Isolation (FDI) methodology for nonlinear LSS in a PnP framework. The LS ...

2015

Implementation of a Distributed Computation Framework

Matej Pavlovic

This project aims at building a dynamic and scalable framework for Byzantine fault tolerant distributed computation. By organizing nodes of a distributed system in fault-tolerant clusters, we mask Byzantine failures of single nodes and provide an abstracti ...

2013

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely

We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...

2013

Byzantine Agreement with Homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

Springer2013

Consensus in the presence of mortal Byzantine faulty processes

Martin Biely

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model "mortal Byzantine". After discussing some application examples ...

Springer Verlag2012

Automated Vulnerability Discovery in Distributed Systems

Rachid Guerraoui, George Candea, Radu Banabic

In this paper we present a technique for automatically assessing the amount of damage a small number of participant nodes can inﬂict on the overall performance of a large distributed system. We propose a feedback-driven tool that synthesizes malicious node ...

2011

Byzantine agreement with homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

ACM Press2011

The impossibility of boosting distributed service resilience

Rachid Guerraoui

We study f -resilient services, which are guaranteed to operate as long as no more than f of the associated processes fail. We prove three theorems asserting the impossibility of boosting the resilience of such services. Our ﬁrst theorem allows any connect ...

Elsevier2011

Generalized Universality

Rachid Guerraoui

State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction ...

Springer Berlin Heidelberg2011