16 search results - page 1 / 4 » Interprocedural Partial Redundancy Elimination and its Appli... |
PLDI
1995
ACM
1995
ACM
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
13 years 8 months ago
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
MICRO
2000
IEEE
13 years 4 months ago
2000
IEEE
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
ICPP
1998
IEEE
13 years 8 months ago
1998
IEEE
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...
IEEEPACT
2006
IEEE
13 years 10 months ago
2006
IEEE
Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effectiv...
ASPLOS
1996
ACM
13 years 8 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...