Concept

Passage de messages

Publications associées (189)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Failure detectors as type boosters

Rachid Guerraoui

The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is called the consensus power of T. This paper addresses the question of the we ...

Springer-Verlag2008

A new parallelized 3D SPH model: resolution of water entry problems ans scalability study

Pierre Maruzewski

The parallelized model is first presented and a scalability study is achieved. For computational time saving and memory requirement reasons, the implementation of a three dimensional SPH code implies the need for its parallelization, in order to make possi ...

2008

ProtoPeer: from Simulation to Live Deployment in One Step

Karl Aberer, Wojciech Galuba, Zoran Despotovic

We present ProtoPeer, a peer-to-peer systems prototyping toolkit that allows for switching between the event driven simulation and live network deployment without changing any of the application code. ProtoPeer exports a set of APIs for message passing, me ...

2008

Equivalences and calculi for formal verification of cryptographic protocols

Johannes Borgström

Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptograp ...

EPFL2008

On the Complexity of Asynchronous Gossip

Rachid Guerraoui, Seth Gilbert

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the ...

2008

Synchronous versus asynchronous modeling of gene regulatory networks

Giovanni De Micheli, Abhishek Garg, Ioannis Xenarios

In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene–gene, ...

2008

Dynamic Testing of Flow Graph Based Parallel Applications

Roger Hersch

In message-passing parallel applications, messages are not delivered in a strict order. The number of messages, their content and their destination may depend on the ordering of their delivery. Nevertheless, for most applications, the computation results s ...

ACM2008

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Martin Vetterli, Patrick Thiran, Florence Bénézit, Patrick Denantes

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Institute of Electrical and Electronics Engineers2008

The Collective Memory of Amnesic Processes

Rachid Guerraoui, Bastian Pochon, James Pugh, Ron Levy

This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and introduc ...

2008

Visual Debugging of MPI Applications

Roger Hersch, Ali Al-Shabibi

We present the design and implementation of a debugging tool that displays a message-passing graph of the execution of an MPI application. Parts of the graph can be hidden or highlighted based on the stack trace, calling process or communicator of MPI call ...

Springer2008