Concept

Parallel programming model

Publications associées (190)

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

Efficient Support for Irregular Applications on Distributed-Memory Machines

James Richard Larus

Irregular computation problems underlie many important scientific applications. Although these problems are computationally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type ...

ACM1995

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

Integrating Parallelization Strategies for Linkage Analysis

Willy Zwaenepoel, Sandhya Dwarkadas

We describe a second parallel implementation of the ILINK program from the LINKAGE package that improves on our previous implementation [Human Heredity 44 (1994), pp. 127-141]. To improve running time we integrated the strategy of parallel estimation of th ...

1995

Message Passing Versus Distributed Shared Memory on Networks of Workstations

Willy Zwaenepoel, Sandhya Dwarkadas

The message passing programs are executed with the Parallel Virtual Machine (PVM) library and the shared memory programs are executed using TreadMarks. The programs are Water and Barnes-Hut from the SPLASH benchmark suite; 3-D FFT, Integer Sort (IS) and Em ...

1995

Portably Supporting Parallel Programming Languages

James Richard Larus, David Wood

To find out where software is headed, experts in academia and industry share their vision of software's future. It is a snapshot in time of where we have been and possibly where we are headed. The subjects discussed are: the desktop; software technology; o ...

IEEE1995

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

LCM: Memory System Support for Parallel Language Implementation

James Richard Larus

Higher-level parallel programming languages can be difficult to implement efficiently on parallel machines. This paper shows how a flexible, compiler-controlled memory system can help achieve good performance for language constructs that previously appeare ...

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

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