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

Quantifying the Performance Differences Between PVM and TreadMarks

Willy Zwaenepoel, Sandhya Dwarkadas

We compare two systems for parallel programming on networks of workstations: Parallel Virtual Machine (PVM) a message passing system, and TreadMarks, a software distributed shared memory (DSM) system. We present results for eight applications that were imp ...

1997

Evaluating the performance of software distributed shared memory as a target for parallelizing compilers

Willy Zwaenepoel, Sandhya Dwarkadas

In this paper we evaluate the use of software distributed shared memory (DSM) on a message passing machine as the target for a parallelizing compiler. We compare this approach to compiler-generated message passing, hand-coded software DSM and hand-coded me ...

1997

Reliable CORBA Event Channels

Rachid Guerraoui, Xavier Défago

This paper presents a pragmatic way to build a Reliable CORBA Event Service. Our approach is pragmatic in the sense that, rather than building the service from scratch, we show how to obtain it, through a simple transformation, from any standard (unreliabl ...

1997

Reliability with CORBA Event Channels

Rachid Guerraoui, Xavier Défago

1997

Optimizing Communication in HPF programs for Fine-Grain Distributed Shared Memory

James Richard Larus

Unlike compiler-generated message-passing code, the coherence mechanisms in shared-memory systems work equally well for regular and irregular programs. In many programs, however compile-time information about data accesses would permit data to be transferr ...

ACM1997

Reliability Issues with CORBA Event Channels

Xavier Défago

In order to increase flexibility and reduce complexity, the use of distributed platforms such as CORBA for building complex distributed systems is growing significantly. Although CORBA platforms provide a better support than conventional RPC mechanisms for ...

1997

Compiler and Software Distributed Shared Memory Support for Irregular Applications

Willy Zwaenepoel

We investigate the use of a software distributed shared memory (DSM) layer to support irregular computations on distributed memory machines. Software DSM supports irregular computation through demand fetching of data in response to memory access faults. Wi ...

1997

An integrated compile-time/run-time software distributed shared memory system

Willy Zwaenepoel, Sandhya Dwarkadas

On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance of hand-coded message passing by translating data-parallel programs into mes ...

1996

The Tempest Approach to Distributed Shared Memory

James Richard Larus, David Wood

This paper summarizes how distributed shared memory (DSM) can be both efficiently and portably supported by the Tempest interface. Tempest is a collection of mechanisms for communication and synchronization in parallel programs. These mechanisms provide co ...

IEEE1996

A Petri Net based approach for modelling multi-layered distributed protocols

Nicoleta Sergent

A Petri Net based approach for modelling multi-layered distributed protocols N. Sergent This paper presents an original modelling approach which aims to provide probabilistic guarantees on time in asynchronous distributed systems for several important algo ...

1996