Publication

A Concurrent Copying Garbage Collector for Languages that Distinguish (Im)mutable Data

Publications associées (44)

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

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

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

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

SANDS Tools : an environment for deriving parallel programs

This paper describes the techniques and the tools developed to construct CO-OPN specifications (Concurrent Object Oriented Petri Nets) and to derive parallel programs. CO-OPN is a specification language allowing to describe concurrent aspects and data-stru ...

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

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

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

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

Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors

James Richard Larus, David Wood

We believe the paucity of massively parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware desig ...

ACM1993