68 search results - page 1 / 14 » Detecting Coarse - Grain Parallelism Using an Interprocedura... |
TPDS
1998
13 years 4 months ago
1998
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
The low cost of clusters built using commodity components has made it possible for many more users to purchase their own supercomputer. However, even modest-sized clusters make si...
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
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
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...