Publication

Dynamic Program Parallelization

Related publications (42)

Graph Chatbot

Chat with Graph Search

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.

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

2009

Compiling scala for the Java virtual machine

Michel Schinz

Scala is a new programming language developed at EPFL and incorporating the most important concepts of object-oriented and functional languages. It aims at integrating well with the Java and .NET platforms: their respective libraries are accessible without ...

EPFL2005

Type-Based Publish/Subscribe

Rachid Guerraoui, Patrick Eugster

This paper presents type-based publish/subscribe, a new variant of the publish/subscribe paradigm. Producers publish message objects on a communication bus, and consumers subscribe to the bus by specifying the types of the objects they are interested in. M ...

2000

Combining Compile-Time and Run-Time Support for Efficient Distributed Shared Memory

Willy Zwaenepoel, Sandhya Dwarkadas

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

1999

OpenMP on Networks of Workstations

Willy Zwaenepoel

We describe an implementation of a sizable subset of OpenMP on networks of workstations (NOWs). By extending the availability of OpenMP to NOWs, we overcome one of its primary drawbacks compared to MPI, namely lack of portability to environments other than ...

1998

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

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

Static Branch Frequency and Program Profile Analysis

James Richard Larus

Program profiles identify frequently executed portions of a program, which are the places at which optimizations offer programmers and compilers the greatest benefit. Compilers, however, infrequently exploit program profiles, because, profiling a program r ...

IEEE1994

Loop-Level Parallelism in Numeric and Symbolic Programs

James Richard Larus

A new technique for estimating and understanding the speed improvement that can result from executing a program on a parallel computer is described. The technique requires no additional programming and minimal effort by a program's author. The analysis beg ...

IEEE1993