Run-Time Parallelization Optimization Techniques Conference Paper uri icon

abstract

  • © Springer-Verlag Berlin Heidelberg 2000. In this paper we first present several compiler techniques to reduce the overhead of run-time parallelization. We show how to use sta- tic 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 structu- res 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.

name of conference

  • Languages and Compilers for Parallel Computing, 12th International Workshop, LCPC'99, La Jolla/San Diego, CA, USA, August 4-6, 1999, Proceedings

published proceedings

  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

author list (cited authors)

  • Yu, H., & Rauchwerger, L

citation count

  • 0

complete list of authors

  • Yu, Hao||Rauchwerger, Lawrence

editor list (cited editors)

  • Carter, L., & Ferrante, J.

publication date

  • January 2000