Concept

Message passing

Related publications (189)

Graph Chatbot

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.

The Weakest Failure Detector for Non-Blocking Atomic Commit

Rachid Guerraoui

This paper addresses the question of the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing. We define a failure detector, denoted by X, which we show to be su ...

2003

Finally the Weakest Failure Detector for Non-Blocking Atomic Commit

Rachid Guerraoui

Recent papers [GK03,HT03] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize t ...

2003

PiLib: A Hosted Language for Pi-Calculus Style Concurrency

Martin Odersky, Vincent Cremet

PiLib is a library written in Scala that implements the concurrency constructs of the Pi-calculus. Some features of the programming language Scala, examined in the paper, make it possible to use almost the same syntax as in the Pi-calculus. The advantages ...

2003

Data-Aware Multicast

Rachid Guerraoui, Patrick Eugster

This paper presents a multicast algorithm for peer-to-peer dissemination of events in a distributed topic-based publish-subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribe ...

2003

A parallel implementation of NEC for the analysis of large structures

Marcos Rubinstein, Abraham Rubinstein

We present a new, parallel version of the numerical electromagnetics code (NEC). The parallelization is based on a bidimensional block-cyclic distribution of matrices on a rectangular processor grid, assuring a theoretically optimal load balance among the ...

2003

Distributed Reliable Object-Oriented Programming (DROOP)

Patrick Eugster

The Simple Object-Oriented Concurrent Programming (SCOOP) model proposed by Bertrand Meyer and illustrated through the Eiffel programming language is a simple yet powerful model for concurrent programming. In this paper, we analyze the applicability of the ...

2003

Towards JMS-Compliant Group Communication

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 ...

2003

Distributed Programming for Dummies: A Shifting Transformation Technique

Rachid Guerraoui, Bastian Pochon

The perfectly synchronized round model provides the powerful abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We present an implementation of this abstraction in a distributed system ...

2003

Pragmatic Type Interoperability

Rachid Guerraoui, Patrick Eugster

Providing type interoperability consists in ensuring that, even if written by different programmers, possibly in different languages and running on different platforms, types that are supposed to represent the same software module are indeed treated as one ...

2003

Pragmatic Type Interoperability

Rachid Guerraoui, Patrick Eugster, Philippe Altherr

2003