Region-based compilation

The increasing amount of instruction-level parallelism (ILP) required to fully utilize high issue-rate processors has forced the compiler to perform more aggressive analysis, optimization, parallelization and scheduling on the input programs. Yet, the compiler designer must scale back the use of aggressive transformations in order to contain compile time and memory usage. The root of the problem lies in the function-oriented framework assumed in conventional compilers. Traditionally the compilation process has been built using the function as a compilation unit, because the function provides a convenient partition of the program. However, the size and contents of a function may not provide the best environment for aggressive analysis and optimization. This dissertation presents a technique in which the compiler is allowed to repartition the program into more desirable compilation units, called regions. Placing the compiler in control of the size and contents of the compilation unit reduces the importance of the algorithmic complexity of the applied transformations, allowing more aggressive transformations to be applied while reducing compilation time.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Hank, Richard Eugene

Contributors dc:contributor

• Hwu, Wen-Mei W.

• Engineering, Electronics and Electrical
• Engineering, System Science
• Computer Science

Statement dc:rights

• Copyright 1996 Hank, Richard Eugene

Language dc:language

eng

Identifier

9780591086966
AAI9702530
(UMI)AAI9702530

OAI identifier oai:identifier

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