Publication

On the weakest failure detector ever

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.

The Exact Hausdorff Measure of the Zero Set of Fractional Brownian Motion

Thomas Mountford, Driss Baraka

Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...

Springer US2011

Consensus when all processes may be Byzantine for some time

Martin Hutle, Martin Biely

Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process a ...

2011

Orthogeodesic Point-Set Embedding of Trees

Radoslav Fulek, Fabrizio Frati

Let S be a set of N grid points in the plane, no two of which lie on the same horizontal or vertical line, and let G be a graph with n vertices (n

Elsevier Science Bv2011

N° 2 Lighthouse Project 2e éd.

Dieter Dietz, Aline Dubach

The Lighthouse Project proposes a house. Named a House it had to address inhabitation: for whom was defined by each student. Additionally the Lighthouse had to include a public function. Light was considered as an attractor and conductor of flows in the ur ...

2011

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

Liberalization and Competition in Postal Markets: Decentralized Infrastructure versus Cherry Picking

Martin Maegli

New entrants in postal markets usually set up delivery networks by concentrating on urban areas and large business customers. This implies that they operate their network highly centralized - at least in early phases of entrance. ...

2010

Alumni Profiles

Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...

2009

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui, Bastian Pochon

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...

2009

Hierarchical diffusion algorithms for distributed estimation

Ali H. Sayed

We study the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest from their measurements. Distributed implementations avoid the use of a fusion center and distribute the processing and co ...

IEEE2009

Designing Routing and Message-Dependent Deadlock Free Networks on Chips

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali, Federico Angiolini

Networks on Chip (NoC) has emerged as the paradigm for designing scalable communication architecture for Systems on Chips (SoCs). Avoiding the conditions that can lead to deadlocks in the network is critical for using NoCs in real designs. Methods that can ...

Springer2008