Compilation Techniques for Explicitly Parallel Programs

We introduce two intermediate representations: the concurrent control flow graph, and the concurrent static single assignment form. Based on these representations, we develop an analysis technique, called concurrent global value numbering, by extending classical value partitioning and global value numbering. We also extend commonly used classical compiler optimization techniques to parallel program using those intermediate representations. By doing this, we guarantee the correctness (sequential consistency) of the optimized program and maintain single processor performance in a multiprocessor environment. We also describe a parallel loop overhead reduction technique.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Lee, Jaejin

Contributors dc:contributor

• Padua, David A.

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI9953074

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81961