Improving the performance of runtime parallelization
1993pp. 83–91
Citations Over TimeTop 10% of 1993 papers
Abstract
When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statically, compile time parallelization of the loop is not possible. In these cases, runtime parallelization [8] is the only alternative. The idea is to transform the loop into two code fragements: the inspector and the executor. When the program is run, the inspector examines the iteration dependencies and constructs a parallel schedule. The executor subsequently uses that schedule to carry out the actual computation in parallel.
Related Papers
- → Advanced loop optimizations for parallel computers(1988)24 cited
- → DOACROSS Parallelization Based on Component Annotation and Loop-Carried Probability(2018)2 cited
- → A Case for Combining Compile-Time and Run-Time Parallelization(1998)9 cited
- → Overcoming the limitations of the traditional loop parallelization(1997)11 cited
- → Combining Compile‐Time and Run‐Time Parallelization(1999)1 cited