• Publications
  • Influence
OpenMP to GPGPU: a compiler framework for automatic translation and optimization
TLDR
This paper presents a compiler framework for automatic source-to-source translation of standard OpenMP applications into CUDA-based GPGPU applications, leading to performance improvements of up to 50X over the unoptimized translation. Expand
  • 474
  • 37
  • PDF
SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance
We present a new benchmark suite for parallel computers. SPEComp targets mid-size parallel servers. It includes a number of science/engineering and data processing applications. Parallelism isExpand
  • 247
  • 28
  • PDF
Cetus: A Source-to-Source Compiler Infrastructure for Multicores
TLDR
The Cetus tool provides an infrastructure for research on multicore compiler optimizations that emphasizes automatic parallelization. Expand
  • 180
  • 16
  • PDF
Parallel Programming with Polaris
TLDR
Parallel programming with Polaris, an experimental translator of conventional Fortran programs that target machines such as the Cray T3D. Expand
  • 379
  • 14
Automatic program parallelization
TLDR
An overview of automatic program parallelization techniques, including straight-line code parallelization, do-loop transformations, and parallelization of recursive routines. Expand
  • 330
  • 13
OpenMPC: Extended OpenMP Programming and Tuning for GPUs
  • S. Lee, R. Eigenmann
  • Computer Science
  • ACM/IEEE International Conference for High…
  • 13 November 2010
TLDR
This paper proposes a new programming interface, called OpenMPC, which builds on OpenMP to provide an abstraction of the complex CUDA programming model and offers high-level controls of the involved parameters and optimizations. Expand
  • 234
  • 11
  • PDF
Cetus - An Extensible Compiler Infrastructure for Source-to-Source Transformation
TLDR
We created Cetus out of the need for a compiler research environment that facilitates the development of interprocedural analysis and parallelization techniques for C. Expand
  • 150
  • 11
  • PDF
The range test: a dependence test for symbolic, non-linear expressions
TLDR
The range test proves independence by determining whether certain symbolic inequalities hold for a permutation of the loop nest.Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions (e.g. A(n*i+j). Expand
  • 127
  • 11
  • PDF
Symbolic range propagation
TLDR
We describe how one can compare expressions by using symbolic ranges of variables, using constraint information derived from the program test. Expand
  • 99
  • 11
  • PDF
Polaris: The Next Generation in Parallelizing Compilers
TLDR
It is the goal of the Polaris project to develop a new parallelizing compiler that will overcome limitations of current compilers. Expand
  • 93
  • 9
...
1
2
3
4
5
...