68 search results - page 9 / 14 » Detecting Coarse - Grain Parallelism Using an Interprocedura... |
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
ICS
1999
Tsinghua U.
15 years 1 months ago
1999
Tsinghua U.
This paper presents a mathematical framework to exploit the semantic properties of matrix operations in loop-based numerical codes. The heart of this framework is an algebraic lan...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
CLUSTER
2003
IEEE
15 years 2 months ago
2003
IEEE
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
IWOMP
2009
Springer
15 years 4 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...