In the last three decades a large number of compiler transformations for optimizing programs
have been implemented. Most optimizations for uniprocessors reduce the number of …

Detecting data races in shared-memory parallel programs is an important debugging
problem. This paper presents a new protocol for run-time detection of data races in …

Standard benchmarking provides to run-times for given programs on given machines, but
fails to provide insight as to why those results were obtained (either in terms of machine or …

The choice of the data domain partitioning scheme is an important factor in determining the
available parallelism and hence the performance of an application on a distributed memory …

Loop distribution is an integral part of transforming a sequential program into a parallel one.
It is used extensively in parallelization, vectorization, and memory management. For loops …

An approach to distributed memory parallel programming that has recently become popular
is one where the programmer explicitly specifies the data decomposition using language …

1 Introduction ln an execution of a shared-memory parallel pro-gram, a data race is said to
exist when there are two or more accesses to the same shared varıable, at least one access …

This paper presents an overview and evaluation of the existing and newly added analysis
and transformation techniques in the Cetus source-to-source compiler infrastructure. Cetus …

An important aspect of any parallel programming tool is its ability to provide useful
information that can help the user optimize a program for efficient parallel execution or …

We present a new approach that enables compiler optimization of procedure calls and loop
nests containing procedure calls. We introduce two interprocedural transformations that …