Demand-driven Inlining in a Region-based Optimizer for ILP Architectures

Simple item page
dc.creatorWay, Thomas P.
dc.creatorPollock, Lori L.
dc.date2006-04-11
dc.date.accessioned2026-07-07T07:09:21Z
dc.date.available2026-07-07T07:09:21Z
dc.descriptionRegion-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.
dc.description23 pages
dc.identifierhttps://arxiv.org/abs/cs/0604043
dc.identifierhttp://arxiv.org/abs/cs/0604043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111032
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectProgramming Languages
dc.subjectD.3.4
dc.titleDemand-driven Inlining in a Region-based Optimizer for ILP Architectures
dc.typetext

Files

Collections

arXiv