This paper describes a compiler that generates both hardware and controlling software for eld-programmable compute accelerators. By analyzing a source program together with part of its input, the compiler generates VHDL descriptions of functional units that are mapped on a set of FPGA chips and an optimized sequence of control instructions that run on the customized machine. The primary techniq...

HIGH level programming languages, in particular the lazy, pure, functional kind, liberate the programmer from having to think about the low-level details of how his code is going to be executed, and they give the compiler extra leeway in optimising the program. This distance to the actual machine makes it harder to reason about the effect of the compiler’s transformations on the program’s perfo...

This paper sketches a rigorous correctness proof of a compiler executable. We will emphasize the central r^ ole of partial program correctness and its preservation, which captures the intuitive correct-ness requirements for transformational programs and in particular for compilers on real machines. Although often left out of sight, implementation veriication is deenitely necessary, not only but...

This paper presents a compiler based approach to automate test case generation. This approach relies on object oriented metrics to identify complex message method sequences in the program. In this approach the compiler compiles the code to generate a graphical model for the object oriented program based on System Dependence Graph. The SDG is augmented with other important information like contr...

An adaptive program can be understood as an object-oriented program where the class graph is a parameter, and hence the class graph may be changed without changing the program. The problem of compiling an adaptive program and a class graph into an object-oriented program was studied by Palsberg, Xiao, and Lieberherr in 1995. Their compiler is efficient but works only in special cases. In this p...

A set of carefully selected compiler optimization options could provide an additional performance boost over the current best default optimization options in the GNU Compiler Collection (GCC) C compiler. However, there are more than 60 optimization options in GCC compiler, which translate to over 260 possible combinations. GCC compiler developers are therefore faced with a challenge. The goal i...

At design time, the compiler writer selects a set of optimizations and an order in which to apply them. These choices have a direct impact on the quality of code that the compiler can generate. They also determine, to a great extent, the set of programs for which the compiler generates good code. Making good choices is difficult for several reasons. The sheer number of transformations that have...

In this paper, we explore a strategy that can be used by a source to source restructuring compiler to exploit implicit loop parallelism in Java programs. First, the compiler must identify the parallel loops in a program. Thereafter, the compiler explicitly expresses this parallelism in the transformed program using the multithreading mechanism of Java. Finally, after a single compilation of the...

We design a high-level abstraction of CUDA, called hiCUDA, using compiler directives. It simplifies the tasks in porting sequential applications to NVIDIA GPUs. This paper focuses on the design and implementation of a source-to-source compiler that translates a hiCUDA program into an equivalent CUDA program, and shows that the performance of CUDA code generated by this compiler is comparable to...