Run-Time Parallelization Optimization Techniques

Authors:
Hao Yu;Lawrence Rauchwerger
Affiliations:
-;-
Venue:
LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
Year:
1999

Citing 4
Cited 0

The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization

IEEE Transactions on Parallel and Distributed Systems
Parallel Programming with Polaris

Computer
Run-time parallelization: A framework for parallel computation

Run-time parallelization: A framework for parallel computation
Interprocedural parallelization using memory classification analysis

Interprocedural parallelization using memory classification analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we first present several compiler techniques to reduce the overhead of run-time parallelization. We show how to use static control flow information to reduce the number of memory references that need to be traced at run-time. Then we introduce several methods designed specifically for the parallelization of sparse applications. We detail some heuristics on how to speculate on the type and data structures used by the original code and thus reduce the memory requirements for tracing the sparse access patterns without performing any additional work. Optimization techniques for the sparse reduction parallelization and speculative loop distribution conclude the paper.