Sciweavers

2000 search results - page 162 / 400
» Program Transformation and Proof Transformation
Sort
View
120
Voted
COMBINATORICS
1998
130views more  COMBINATORICS 1998»
15 years 3 months ago
Codes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Stefan M. Dodunekov, Juriaan Simonis
138
Voted
ICS
2009
Tsinghua U.
15 years 10 months ago
MPI-aware compiler optimizations for improving communication-computation overlap
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
Anthony Danalis, Lori L. Pollock, D. Martin Swany,...
145
Voted
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 9 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
113
Voted
PLDI
2000
ACM
15 years 8 months ago
Translation validation for an optimizing compiler
We describe a translation validation infrastructure for the GNU C compiler. During the compilation the infrastructure compares the intermediate form of the program before and afte...
George C. Necula
120
Voted
ICPP
1999
IEEE
15 years 8 months ago
Compiler Optimizations for I/O-Intensive Computations
This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...