Run-time parallelization optimization techniques

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationLanguages and Compilers for Parallel Computing - 12th International Workshop, LCPC 1999, Proceedings
EditorsLarry Carter, Jeanne Ferrante
Number of pages4
ISBN (Print)9783540678588
StatePublished - 2000
Externally publishedYes
Event12th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1999 - La Jolla, United States
Duration: Aug 4 1999Aug 6 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th International Workshop on Languages and Compilers for Parallel Computing, LCPC 1999
Country/TerritoryUnited States
CityLa Jolla

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Run-time parallelization optimization techniques'. Together they form a unique fingerprint.

Cite this