In this paper we present a surprisingly simple reduction of the program dependence problem to the may-alias problem. While both problems are undecid-able, providing a reduction between them has great practical importance. Program dependence information is used extensively in compiler optimizations, automatic program parallelizations, code scheduling in super-scalar machines, and in software eng...

We describe two approaches to showing program equivalence. Program equivalence is useful for showing that a program created by an optimizing compiler is correct. The optimized version of the program can be compared to a program that is created from the same source code by a verified compiler that performs no optimizations. Our first approach consists of using a theorem prover, ACL2, to prove th...

In this paper we present a surprisingly simple reduction of the program dependence problem to the may-alias problem. While both problems are undecidable, providing a bridge between them has great practical importance. Program dependence information is used extensively in compiler optimizations, automatic program parallelizations, code scheduling in super-scalar machines, and in software enginee...

This paper gives a survey of a novel programming method for reconfigurable architectures. It combines techniques from vectorizing compilers, high-level synthesis, and hardware/software codesign: An imperative high-level language program specifies both the host program (software) and the coprocessor configuration (hardware) of the application. This renders reconfigurable architectures useful for...

Commodity microprocessors uniformly apply branch prediction and single path speculative execution to all kinds of program branches and suuer from the high misprediction penalty which is caused by branches with low prediction accuracy and, in particular, by branches that are unpredictable. The Simultaneous Speculation Scheduling (S 3) technique removes such penalties by a combination of compiler...

The superior performance and cost-eeectiveness of scalable, distributed memory parallel computers will only then become generally exploitable if the programming diiculties with such machines are overcome. We see the ultimate solution in high-level programming models and appropriate parallelizing compilers that allow the user to formulate a parallel program in terms of application-speciic concep...

We propose an infrastructure based on the Open64 compiler for analyzing, modeling and optimizing MPI and/or OpenMP applications. The framework consists of four main parts: a compiler, microbenchmarks, a user interface and a runtime library. The compiler generates the application signature containing a portable representation of the application structure that may influence program performance. M...

This paper presents methods for generating communication on compiling HPF programs for distributed-memory machines. We introduce the concept of an iteration template corresponding to an iteration space. Our HPF compiler performs the loop iteration mapping through the twolevel mapping of the iteration template in the same way as the data mapping is performed in HPF. Making use of this unified ma...