Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2006-04-11
Computer Science
Distributed, Parallel, and Cluster Computing
23 pages
Scientific paper
Region-based compilation repartitions a program into more desirable compilation units using profiling information and procedure inlining to enable region formation analysis. Heuristics play a key role in determining when it is most beneficial to inline procedures during region formation. An ILP optimizing compiler using a region-based approach restructures a program to better reflect dynamic behavior and increase interprocedural optimization and scheduling opportunities. This paper presents an interprocedural compilation technique which performs procedure inlining on-demand, rather than as a separate phase, to improve the ability of a region-based optimizer to control code growth, compilation time and memory usage while improving performance. The interprocedural region formation algorithm utilizes a demand-driven, heuristics-guided approach to inlining, restructuring an input program into interprocedural regions. Experimental results are presented to demonstrate the impact of the algorithm and several inlining heuristics upon a number of traditional and novel compilation characteristics within a region-based ILP compiler and simulator.
Pollock Lori L.
Way Thomas P.
No associations
LandOfFree
Demand-driven Inlining in a Region-based Optimizer for ILP Architectures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Demand-driven Inlining in a Region-based Optimizer for ILP Architectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Demand-driven Inlining in a Region-based Optimizer for ILP Architectures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-286261