Concept

Message Passing Interface

Publications associées (169)

The Weakest Failure Detector for Non-Blocking Atomic Commit

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

On parallel computation of blood flow in human arterial network based on 1-D modelling

Alfio Quarteroni, Luca Formaggia

Parallel computation of blood flow in a 1D model of human arterial network has been carried out employing a Taylor Galerkin finite element method. Message passing interface libraries have been used on Origin 2000 SGI machine. A Greedy strategy for load-dis ...

Springer-Verlag2003

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

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

Lazy Parameter Passing

Patrick Eugster

Peer-to-peer (P2P) systems are strongly decentralized and asynchronous distributed settings involving a potentially large number of hosts. A common programing model for P2P infrastructures is that of a distributed hashtable (DHT), though which peers share ...

2003

A Synthesis of Business Role Models

Alain Wegmann, Pavel Balabko

Modern Information and Communication Technology open a door for innovations that can improve the functioning of companies. Many innovations can come from the analysis of business processes. Today modeling is widely used for the analysis of business process ...

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

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

Failure Detection Lower Bounds on Registers and Consensus (Preliminary Version)

Rachid Guerraoui

This paper addresses the problem of determining the weakest failure detector to implement consensus in a message passing system when t out of n processes can crash (including when n/2 =< t < n-1), by addressing the problem of determining the weakest failur ...

2002

An Efficient Universal Construction for Message-Passing Systems

Rachid Guerraoui, Bastian Pochon, Partha Dutta

A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a novel universal construction algorithm for a message-passing system w ...

2002

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