D. W. Goodwin. Interprocedural data ow analysis in an executable optimizer. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, pages 122-133, Las Vegas, Nevada, June 15-18, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Speculative Alias Analysis for Executable Code - Fernández, Espasa (2002) (Correct)
....based on reordering memory operations; in particular, for those related to data speculation on the IA 64 architecture. Keywords: alias analysis, pro le guided speculation, link time optimizers. 1 Introduction Optimizations performed at link time or directly applied to nal program executables [31, 19, 11, 25] have received increased attention in recent years, due to two main reasons. First, large programs tend to be compiled using separate compilation, that is, one or a few les at a time. Therefore, the compiler does not have the opportunity to optimize the full program as a whole, even when ....
....of 1.04 ) This fact is encouraging, hinting that even for those optimizations with high cost recovery techniques, our speculative alias analysis might prove very useful given its high accuracy. 5 Related work While a number of systems have been described for optimization of executable code [31, 19, 11, 25], to the best of our knowledge, alias analysis carried out by these systems is limited to fairly simple local analysis. On the other hand, there is an extensive work on pointer alias analysis of various kinds [33, 30, 15, 10, 18] However, in almost all cases, these are high level analyses carried ....
D. W. Goodwin. Interprocedural data ow analysis in an executable optimizer. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, pages 122-133, Las Vegas, Nevada, June 15-18, 1997.
Whole-Program Optimization of Binary Executables - De Sutter, De Bosschere, De.. (2000) (Correct)
....[13] is a post link time optimizer by Compaq for their Alpha Unix systems. Started as a post linking system for optimizing the 64 bit calculations also targeted by our constant propagator, OM also performs invariant code motion out of loops and interprocedural dead code elimination. Spike [16] [17] optimizes executables for the Alpha NT environment. It concentrates on global register allocation and global code layout: using pro le information a code layout is produced using so called hot cold optimizations to improve cache behavior. MLD [18] and Vortex [19] are two whole program optimizers ....
D.W. Goodwin, \Interprocedural data ow analysis in an executable optimizer," in Proceedings of the ACM SIGPLAN'97 ConferenceonProgramming Language Design and Implementation, June 1997, pp. 122-133.
Architecture-level Dependence Analysis for Software Systems - Stafford, Wolf (2000) (3 citations) (Correct)
....of identifying the components of a system that either a ect or are a ected by a particular component in some way. In fact, these kinds of questions are similar to those currently asked at the implementation level and answered through a technique known as dependence analysis applied to program code [1, 3, 10, 11, 16, 24, 26, 28, 29, 38]. It seems reasonable, therefore, to apply a similar technique at the architectural level, either because the program code may not exist at the time the question is being asked or because answering the question at the architectural level is more tractable than at the implementation level [36] ....
D.W. Goodwin. Interprocedural Data ow Analysis in an Executable Optimizer. In Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, pages 122-133. ACM SIGPLAN, June 1997.
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