Publication

Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering

Publications associées (34)

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

TreadMarks: Shared Memory Computing on Networks of Workstations

Willy Zwaenepoel, Sandhya Dwarkadas

TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of paralleli ...

1996

Compiler-directed Shared-Memory Communication for Iterative Parallel Applications

James Richard Larus

Many scientific applications are iterative and specify repetitive communication patterns. This paper shows how a parallel-language compiler and a predictive cache-coherence protocol in a distributed shared memory system together can implement shared-memory ...

ACM/IEEE1996

Instruction Scheduling and Executable Editing (prelim)

James Richard Larus

In most modern operating systems, a process is a hardware-protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms---dynamic code loading, run-time code generation, shared memory, and intrusive syste ...

IEEE1996

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

StormWatch: A Tool for Visualizing Memory System Protocols

James Richard Larus

Recent research has offered programmers increased options for programming parallel computers by exposing system policies (e.g., memory coherence protocols) or by providing several programming paradigms (e.g. message passing and shared memory) on the same p ...

ACM/IEEE1995

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

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

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

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

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