Concept
File d'attente de message
Publications associées (112)
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 Association2023Private Message Franking with After Opening Privacy
Serge Vaudenay, Iraklis Leontiadis
Recently Grubbs et al. [GLR17] initiated the formal study of message franking protocols. This new type of service launched by Facebook, allows the receiver in a secure messaging application to verifiably report to a third party an abusive message some send ...
2023ACACIA: a new method to produce on-the-fly merger trees in the RAMSES code
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 PRESS2022DATASHARENETWORK A Decentralized Privacy-Preserving Search Engine for Investigative Journalists
Carmela González Troncoso, Wouter Lueks, Laurent Girod, Bruno Thomas
Investigative journalists collect large numbers of digital documents during their investigations. These documents can greatly benefit other journalists' work. However, many of these documents contain sensitive information. Hence, possessing such documents ...
USENIX ASSOC2020How hard is to distinguish graphs with graph neural networks?
A hallmark of graph neural networks is their ability to distinguish the isomorphism class of their inputs. This study derives hardness results for the classification variant of graph isomorphism in the message-passing model (MPNN). MPNN encompasses the maj ...
2020Explicit dynamic approach for unbounded domains in frictional contact with Rate and State laws
Jean-François Molinari, Roozbeh Rezakhani
The paper explores the ability of an explicit time integration procedure to simulate the dynamics of shear rupture between unbounded elastic blocks on frictional interface, modeled with the finite element method. The behaviour of the interface is governed ...
ELSEVIER2020The weakest failure detector for eventual consistency
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. If we consider an asynchronous messagepassing environment in which processes might fail by crashing, and assume that a majority ...
2019RPCValet: 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, ...
ACM2019A Minimally Intrusive Low-Memory Approach to Resilience for Existing Transient Solvers
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 ...
2019Scaling Byzantine Fault Tolerance
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