5 search results - page 1 / 1 » Time-Stamping Algorithms for Parallelization of Loops at Run... |
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
IRREGULAR
1995
Springer
13 years 8 months ago
1995
Springer
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
HPCA
1998
IEEE
13 years 9 months ago
1998
IEEE
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
ICPADS
2007
IEEE
13 years 11 months ago
2007
IEEE
For some sequential loops, existing techniques that form speculative threads only at their loop boundaries do not adequately expose the speculative parallelism inherent in them. T...
ICS
2010
Tsinghua U.
13 years 9 months ago
2010
Tsinghua U.
Because of their tremendous computing power and remarkable cost efficiency, GPUs (graphic processing unit) have quickly emerged as an influential computing platform for a broad ...