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

Method to Filter Electronic Messages in A Message Processing System

Jean-Yves Le Boudec, Slavisa Sarafijanovic

The present invention proposes a method to filter electronic messages in a message processing system, this message processing system comprising a temporary memory for storing the received messages intended to users, a first database dedicated to a specific ...

2006

Community-Aware Event Dissemination

Rachid Guerraoui, Oana Anca Jurca, Patrick Eugster

This paper presents a distributed algorithm to disseminate events in a publish/subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribed to. Every topic defines a dynamic notio ...

2006

Broadcasting a message over erasure channels with cooperating receivers

Ramin Khalili

In this paper we consider the orthogonal cooperative broadcast channel with a common message. The downlink and cooperation channels are modelled by erasure channels and assumed to be orthogonal. We derive an achievable rate for this channel by using a comb ...

2006

How Fast can a Distributed Atomic Read be?

Rachid Guerraoui, Marko Vukolic, Ron Levy, Partha Dutta

We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as failure prone server processes implementing the data structure. We ...

2005

Consistent Main-Memory Database Federations under Deferred Disk Writes

Rodrigo Malta Schmidt, Fernando Pedone

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers. FMMDBs significantly improve performance by avoiding I/O during t ...

2005

liblaiogen, a generic LAIO implementation

Olivier Crameri

This thesis introduces a new implementation of the LAIO api, liblaiogen. LAIO stands for Lazy Asynchronous I/O. It is an api for performing asynchronous I/O. Among several benefits, one of the most important is that LAIO is lazy, in the sense that it creat ...

2005

JMSGroups

Arnas Kupsys

Nowadays, computers are the indispensable part of our life. They evolve rapidly and are more and more versatile. Computer networks made the remote corners of the world just a click away. But unavoidably, any software and hardware component is subject to fa ...

EPFL2005

A Model for Parallel Programming over CORBA

Existing models for parallel programming over Common Object Request Broker Architecture (CORBA) do not address issues specific to parallel programming over a Network of Workstations (NOWs). This paper presents P-CORBA, a model for parallel programming over ...

2004

Robust Emulations of Shared Memory in a Crash-Recovery Model

Rachid Guerraoui, Ron Levy

A shared memory abstraction can be robustly emulated over an asynchronous message passing system where any process can fail by crashing and possibly recover (crash-recovery model), by having (a) the processes exchange messages to synchronize their read and ...

2004

Towards JMS Compliant Group Communication - a Semantic Mapping

André Schiper, Matthias Wiesmann, Stefan Pleisch, Arnas Kupsys

Group communication provides communication primitives with various semantics and their use greatly simplifies the development of highly available services. However, despite tremendous advances in research and numerous prototypes, group communication stays ...

2004