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.
We describe an integrated compile-time and run-time system for efficient shared memory parallel computing on distributed memory machines. The combined system presents the user with a shared memory programming model, with its well-known benefits in terms of ...
This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denot ...
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 ...
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 ...
The author compares the measured performance of pipes implemented by a pipe server process on top of the V message passing transport protocol versus the calculated performance of pipes implemented by an operating system kernel and supported by a dedicated ...
Loosely coupled multiprocessor systems communicate by message passing. Traditional implementations of message passing architectures are based on communication controllers accessing local memory through DMA channels. The authors describe a completely new co ...
The author compares the measured performance of pipes implemented by a pipe server process on top of the V message passing transport protocol versus the calculated performance of pipes implemented by an operating system kernel and supported by a dedicated ...
Message passing and shared memory are two techniques parallel programs use for coordination and communication. This paper studies the strengths and weaknesses of these two mechanisms by comparing equivalent, well-written message-passing and shared-memory p ...
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 ...
The author compares the measured performance of pipes implemented by a pipe server process on top of the V message passing transport protocol versus the calculated performance of pipes implemented by an operating system kernel and supported by a dedicated ...
