Concept

Mémoire virtuelle

Publications associées (259)

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

Tempest: A Substrate for Portable Parallel Programs

James Richard Larus, David Wood

The paper describes Tempest, a collection of mechanisms for communication and synchronization in parallel programs. With these mechanisms, authors of compilers, libraries, and application programs can exploit-across a wide range of hardware platforms-the b ...

IEEE1995

Modélisation stochastique de la solidification eutectique équiaxe

The solidification of eutectic alloys has been described by means of stochastic methods. These methods allow some of the hypotheses which are usually made in deterministic models to be relaxed, in particular those related to the description of grain imping ...

EPFL1995

Techniques for Reducing Consistency-Related Communication in Distributed Shared Memory System

Willy Zwaenepoel

Distributed shared memory 8DSM) is an abstraction of shared memory on a distributed memory machine. Hardware DSM systems support this abstraction at the architecture level; software DSM systems support the abstraction within the runtime system. One of the ...

1995

Application-specific protocols for user-level shared memory

Babak Falsafi, James Richard Larus, David Wood

Recent distributed shared memory (DSM) systems and proposed shared-memory machines have implemented some or all of their cache coherence protocols in software. One way to exploit the flexibility of this software is to tailor a coherence protocol to match a ...

1994

Software vs. Hardware Shared Memory Implementation: A Case Study

Willy Zwaenepoel, Sandhya Dwarkadas

We compare the performance of software-supported shared memory on a general-purpose network to hardware-supported shared memory on a dedicated interconnect. Up to eight processors, our results are based on the execution of a set of application programs on ...

1994

Fine-grain access control for distributed shared memory

Babak Falsafi, James Richard Larus, David Wood

The paper discusses implementations of fine-grain memory access control, which selectively restricts reads and writes to cache-block-sized memory regions. Fine-grain access control forms the basis of efficient cache- coherent shared memory. The paper focus ...

1994

Where is Time Spent in Message-Passing and Shared-Memory Programs?

James Richard Larus

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

ACM1994

Tempest and Typhoon: User-Level Shared Memory

James Richard Larus, David Wood

Future parallel computers must efficiently execute not only hand-coded applications but also programs written in high-level, parallel programming languages. Today’s machines limit these programs to a single communication paradigm, either message-passing or ...

ACM1994

Cachier: A Tool for Automatically Inserting CICO Annotations

James Richard Larus

Shared memory in a parallel computer provides programmers with the valuable abstraction of a shared address space--through which any part of a computation can access any datum. Although uniform access simplifies programming, it also hides communication, wh ...

IEEE1994

Parallelization of General Linkage Analysis Problems

Willy Zwaenepoel, Sandhya Dwarkadas

We describe a parallel implementation of a genetic linkage analysis program that achieves good speedups, even for analyses on a single pedigree and with a single starting recombination fraction vector. Our parallel implementation has been run on three diff ...

1994