Publication

The Weakest Failure Detector for Message Passing Set-Agreement

Publications associées (25)

The Two Times Problem: Where Is the Problem?

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

Brill2024

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

ACACIA: a new method to produce on-the-fly merger trees in the RAMSES code

Mladen Ivkovic

The implementation of ACACIA, a new algorithm to generate dark matter halo merger trees with the Adaptive Mesh Refinement code RAMSES, is presented. The algorithm is fully parallel and based on the Message Passing Interface. As opposed to most available me ...

OXFORD UNIV PRESS2022

Dynamic Byzantine Reliable Broadcast

Rachid Guerraoui, Dragos-Adrian Seredinschi, Jovan Komatovic, Andrei Tonkikh

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021

Gaussian and sparse processes are limits of generalized Poisson processes

Michaël Unser, Virginie Sophie Uhlmann, Julien René Pierre Fageot

The theory of sparse stochastic processes offers a broad class of statistical models to study signals, far beyond the more classical class of Gaussian processes. In this framework, signals are represented as realizations of random processes that are soluti ...

2020

Scaling Byzantine Fault Tolerance

Matej Pavlovic

Online services are becoming more and more ubiquitous and keep growing in scale. At the same time, they are required to be highly available, secure, energy-efficient, and to achieve high performance. To ensure these (and many other) properties, replication ...

EPFL2019

A Minimally Intrusive Low-Memory Approach to Resilience for Existing Transient Solvers

Allan Svejstrup Nielsen

We propose a novel, minimally intrusive approach to adding fault tolerance to existing complex scientific simulation codes, used for addressing a broad range of time-dependent problems on the next generation of supercomputers. Exascale systems have the pot ...

2019

Asynchronous Simulation of Neuronal Activity

Bruno Ricardo Da Cunha Magalhães

Simulations of the electrical activity of networks of morphologically-detailed neuron models allow for a better understanding of the brain. Short time to solution is critical in order to study long biological processes such as synaptic plasticity and learn ...

EPFL2019

RPCValet: NI-Driven Tail-Aware Balancing of µs-Scale RPCs

Babak Falsafi, Alexandros Daglis, Mark Johnathon Sutherland

Modern online services come with stringent quality requirements in terms of response time tail latency. Because of their decomposition into fine-grained communicating software layers, a single user request fans out into a plethora of short, μs-scale RPCs, ...

ACM2019

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

Georgios Chatzopoulos

As hardware evolves, so do the needs of applications. To increase the performance of an application, there exist two well-known approaches. These are scaling up an application, using a larger multi-core platform, or scaling out, by distributing work to mul ...

EPFL2018

How Fast can a Distributed Transaction Commit?

Rachid Guerraoui, Junxiong Wang

The atomic commit problem lies at the heart of distributed database systems. The problem consists for a set of processes (database nodes) to agree on whether to commit or abort a transaction (agreement property). The commit decision can only be taken if al ...

ACM Press2017

The gene family-free median of three

Metin Balaban

Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...

2017

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

2015

Isolates, channels, and event streams for composable distributed programming

Martin Odersky, Aleksandar Prokopec

The actor model has been a model of choice for building reliable distributed systems. On one hand, it ensures that message-processing is serialized within each actor, preserving the familiar sequential programming model. On the other hand, programs written ...

ACM2015

Reactive Processing of RDF Streams of Events

Karl Aberer, Jean Paul Calbimonte Perez

Events on the Web are increasingly being produced in the form of data streams, and are present in many different scenarios and applications such as health monitoring, environmental sensing or social networks. The heterogeneity of event streams has raised t ...

2015

Efficient Communication and Synchronization on Manycore Processors

Darko Petrovic

The increased number of cores integrated on a chip has brought about a number of challenges. Concerns about the scalability of cache coherence protocols have urged both researchers and practitioners to explore alternative programming models, where cache co ...

EPFL2015

Language Support for Distributed Functional Programming

Heather Christine Klug

Software development has taken a fundamental turn. Software today has gone from simple, closed programs running on a single machine, to massively open programs, patching together user experiences byway of responses received via hundreds of network requests ...

EPFL2015

High-Performance Communication Primitives and Data Structures on Message-Passing Manycores : Broadcast and Map

Omid Shahmirzadi

The constant increase in single core frequency reached a plateau during recent years since the produced heat inside the chip cannot be cooled down by existing technologies anymore. An alternative to harvest more computational power per die is to fabricate ...

EPFL2014

The Generalized Loneliness Detector and Weak System Models for k-Set Agreement

Martin Biely

This paper presents two weak partially synchronous system models Manti(n-k) and Msink(n-k), which are just strong enough for solving k-set agreement: We introduce the generalized (n-k)-loneliness failure detector L(k), which we first prove to be sufficient ...

Ieee Computer Soc2014

Leveraging Hardware Message Passing for Efficient Thread Synchronization

André Schiper, Darko Petrovic, Thomas Ropars

As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms for thread synchronization in concurrent programs is becoming a major concern. On cache-coherent shared-memory processors, synchronization efficiency is ult ...

2014