Publications related to Message passing

uKharon: A Membership Service for Microsecond Applications

Rachid Guerraoui, Antoine Murat, Javier Picorel Obando, Athanasios Xygkis

Modern data center fabrics open the possibility of microsecond distributed applications, such as data stores and message queues. A challenging aspect of their development is to ensure that, besides being fast in the common case, these applications react fa ...

USENIX Association2023

Leaderless consensus

Rachid Guerraoui, Gauthier Jérôme Timothée Voron, Vincent Gramoli, Mihail Igor Zablotchi, Karolos Antoniadis, Antoine Philippe Matthieu Desjardins

Classic synchronous consensus algorithms are leaderless in that processes exchange proposals, choose the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are typically leader-based. Although t ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Learning Dynamics of Spring-Mass Models with Physics-Informed Graph Neural Networks

Olga Fink, Vinay Sharma, Manav Manav

We propose a physics-informed message-passing graph neural network (GNN) for learning the dynamics of springmass systems. The proposed method embeds the underlying physics directly into the message-passing scheme of the GNN. We compare the new scheme with ...

Research Publishing2023

Bias Cancellation of MixColumns

Francesco Regazzoni, Andrea Felice Caforio, Subhadeep Banik

At COSADE'2020, Carre et al. established a novel biascancelling property of the AES MixColumns matrix that effectively corrects any skewed output distribution of a state byte due to a faulty substitution box. Consequently, any effected byte is rendered uni ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

2022

Leaderless Consensus

Rachid Guerraoui, Vincent Gramoli, Mihail Igor Zablotchi, Karolos Antoniadis, Antoine Philippe Matthieu Desjardins

Abstract—Classical synchronous consensus algorithms are leaderless: processes exchange their proposals, pick the max and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are more robust in that they only req ...

2021

Leaderless Consensus

Rachid Guerraoui, Vincent Gramoli, Mihail Igor Zablotchi, Karolos Antoniadis, Antoine Philippe Matthieu Desjardins

Classical synchronous consensus algorithms are leaderless: processes exchange their proposals, retain the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are more robust in that they only req ...

IEEE COMPUTER SOC2021

Dynamic Byzantine Reliable Broadcast

Rachid Guerraoui, Jovan Komatovic, Dragos-Adrian Seredinschi, 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

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.

Message passing

uKharon: A Membership Service for Microsecond Applications

Private Message Franking with After Opening Privacy

Leaderless consensus

Learning Dynamics of Spring-Mass Models with Physics-Informed Graph Neural Networks

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

Bias Cancellation of MixColumns

The Universal Gossip Fighter

Leaderless Consensus

Leaderless Consensus

Dynamic Byzantine Reliable Broadcast

Graph Chatbot

Chat with Graph Search

uKharon: A Membership Service for Microsecond Applications

Leaderless consensus

Leaderless Consensus

Dynamic Byzantine Reliable Broadcast

The Universal Gossip Fighter

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

Leaderless Consensus

Private Message Franking with After Opening Privacy

Bias Cancellation of MixColumns

Learning Dynamics of Spring-Mass Models with Physics-Informed Graph Neural Networks