Publication

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Publications associées (18)

Axo: Tolerating Delay Faults in Real-Time Systems

Jean-Yves Le Boudec, Simon Bliudze, Wajeb Saab, Maaz Mashood Mohiuddin

We address delay faults: faults that cause a software component to take more time for completing an action than a given deadline. Such faults are particularly of interest in real- time mission-critical control applications that use general-purpose computin ...

2016

Incremental Syllable-Context Phonetic Vocoding

Petr Motlicek, Philip Neil Garner, Milos Cernak

Current very low bit rate speech coders are, due to complexity limitations, designed to work off-line. This paper investigates incremental speech coding that operates real-time and incrementally (i.e., encoded speech depends only on already-uttered speech ...

2015

Comparative Study of Trust Modeling For Automatic Landmark Tagging

Touradj Ebrahimi, Ivan Ivanov, Péter Vajda

Many images uploaded to social networks are related to travel, since people consider traveling to be an important event in their life. However, a signiﬁcant amount of travel images on the Internet lack proper geographical annotations or tags. In many cases ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...

2012

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

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...

IEEE2012

Model Checking of Distributed Algorithm Implementations

Maysam Yabandeh

It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from ...

EPFL2011

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