Alan Dean Samples, "Profile Driven Compilation," Phd. Thesis, University of California at Berkeley, 1991.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Infrastructure for Profile-Driven Dynamic Recompilation - Burger, Dybvig (1998) (11 citations) (Correct)
....optimal counter placement that is faster and eliminates the need for a separate depth first search for count propagation. We have used Pettis and Hansen s intraprocedural block reordering strategy with only minor modifications to apply it in the context of dynamic recompilation. Samples [26] explores a similar intraprocedural algorithm that reduces instruction cache miss rates by up to 50 . Pettis and Hansen [24] also describe an interprocedural algorithm that places procedures in memory such that those that execute close together in time will also be close together in memory. Since ....
A. Dain Samples. Profile-driven compilation. Technical Report 627, University of California, Berkeley, 1991.
Path Splitting: A Technique for Improving Data Flow Analysis - Poletto (1995) (1 citation) (Correct)
....of joins in the control flow graph. For all real applications compiled with this technique (for example, gcc and espresso) assembler file size often increased by a few orders of magnitude, rendering the technique infeasible. One obvious method for reducing this code growth is feedback. Samples [37] presents an in depth analysis of light weight, efficient methods for run time profiling. Ball and Larus [6] also discuss this problem. Another, promising technique is static branch prediction and profile estimation. Various studies [22, 44, 43] indicate that static flow analysis is almost as ....
Alan Dain Samples. Profile-driven Compilation. PhD thesis, U.C. Berkeley, April 1991. U.C. Berkeley CSD-91-627.
A Transparent Method for Correlating Profiles with Source.. - Eugene Albert Gem (1999) (5 citations) (Correct)
No context found.
Alan Dean Samples, "Profile Driven Compilation," Phd. Thesis, University of California at Berkeley, 1991.
Selecting Better-Performing Alternative Code Using Run-Time.. - Ping-Shun Huang (1995) (1 citation) (Correct)
No context found.
Alan Dain Samples, Profile-driven Compilation. U.C. Berkeley CSD-91-627, April 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC