R. Horspool and H. Ho. Partial redundancy elimination driven by a costbene t analysis, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....pioneered by the algorithm of Morel and Renvoise [25] has thoroughly been studied in the literature. The (intraprocedural) state of the art algorithms fall into two major groups. First, algorithms aiming at eliminating redundancies among lexically identical terms, also known as syntactic PRE (cf. [2, 5, 6, 7, 8, 12, 15, 19, 20, 13, 29, 28]) Second, algorithms aiming at eliminating redundancies also among lexically di#erent, yet semantically equivalent computations, also known as semantic PRE (cf. 1, 3, 23, 27, 31, 30] The enhanced transformational power of the algorithms of the second group comes at the price of significantly ....

R. N. Horspool and H. C. Ho. Partial redundancy elimination driven by a costbenefit analysis. In Proc. 8th Israeli Conf. on Computer Systems and Software Engineering (CSSE'97), pages 111 -- 118, 1997.

....executed paths at the expense of introducing additional (new) computations along some less frequently executed paths. So the safety criterion [20] enforced in classic PRE methods is no longer honored. There are two previously published papers devoted entirely to speculation based PRE (SPRE) [18, 19]. Horspool and Ho [19] use edge profiling information to determine the profitability of using speculation while Gupta, Berson and Fang [18] employ more expensive path profiling. While being capable of minimizing the number of computations in some cases as compared to the classic PRE methods, both ....

....expense of introducing additional (new) computations along some less frequently executed paths. So the safety criterion [20] enforced in classic PRE methods is no longer honored. There are two previously published papers devoted entirely to speculation based PRE (SPRE) 18, 19] Horspool and Ho [19] use edge profiling information to determine the profitability of using speculation while Gupta, Berson and Fang [18] employ more expensive path profiling. While being capable of minimizing the number of computations in some cases as compared to the classic PRE methods, both algorithms are, in ....

[Article contains additional citation context not shown here]

R. Horspool and H. Ho. Partial redundancy elimination driven by a cost-benefit analysis. In 8th Israeli Conference on Computer System and Software Engineering, pages 111-- 118, 1997.

....perform speculation for instructions that cannot cause exceptions, but this is not the case for speculative loads. In order to deal with safe insertions only, our implementation of partial LRE is restricted to global and stack references. We have followed the approach described by Horspool and Ho [8], that proposed a general profile driven PRE algorithm based upon edge profiles. The idea is to insert copies on less frequently executed paths in favor of more frequently executed paths. We have adapted their algorithm to (a) only consider redundant load operations, and (b) to deal with our ....

R. N. Horspool and H. C. Ho. Partial redundancy elimination driven by a costbenefit analysis. In 8th Israeli Conference on Computer System and Software Engineering, pages 111--118, Herzliya, Israel, June 1997.

....only if neither the stack pointer changes within the function (except the entry and exit points) nor other callee function store values in the stack out of its stack frame. For the implementation of our partial LRE optimization, we have followed the approach described by Horspool and Ho [14]. They proposed a general profile driven PRE algorithm based upon edge profiles. The main idea is to insert copies on less frequently executed paths in favor of more frequently executed paths, as shown if Figure 5. We have adapted their algorithm to (a) only consider redundant load operations and ....

....are only load operations. PRE [16, 8] is a well known scalar optimization that subsumes various ad hoc code motion optimizations (as common subexpression elimination and loop invariant code motion) by attempting to remove redundancies that occur only on some control flow paths. Horspool and Ho [14] described a new formulation of PRE based on a cost benefit of the flowgraph, by using edge profiles (our current implementation of partial LRE optimization is based in their equations) Gupta, Berson and Fang [13] extended this profile driven PRE algorithm by using path profiles. Register ....

R. N. Horspool and H. C. Ho. Partial redundancy elimination driven by a cost-benefit analysis. In 8th Israeli Conference on Computer System and Software Engineering, pages 111--118, Herzliya, Israel, June 1997.

....subexpression elimination (CSE) eliminates an expression that is preceded by an identical computation along all incoming paths. Finally, partial redundancy elimination (PRE) subsumes LICM and CSE by eliminating redundancy from instructions that are redundant along only a subset of incoming paths [1, 6, 7, 9, 13, 14, 16, 17, 19]. Since PRE is the most general redundancy elimination, the focus of this paper is on developing an improved PRE algorithm. PRE algorithms avoid repeated computation of the same value by computing the value once, saving it in a temporary, and reusing the value from the temporary when it is needed ....

R.N. Horspool and H.C. Ho, "Partial Redundancy Elimination Driven by a CostBenefit Analysis," 8th Israeli Conference on Computer Systems and Software Engineering, pages 111-118, Herzliya, Israel, June 1997.

....In previous work by Fang [7] the use of speculation during partial redundancy elimination was also proposed. However, the algorithms in [7] apply to a single entry single exit acyclic region and no costbenefit analysis to guide speculation is presented. Independently of our work Horspool and Ho [10] have recently proposed a profile driven PRE algorithm based upon edge profiles. However, our algorithm is superior to theirs because it is more powerful, flexible and efficient. Our algorithm is more powerful because any optimization that is achievable using the node profiles by Horspool and Ho ....

R.N. Horspool and H.C. Ho, "Partial Redundancy Elimination Driven by a Cost-Benefit Analysis," 8th Israeli Conf. on Computer Systems and Software Engineering, pages 111-118, Herzliya, Israel, June 1997.

No context found.

R. N. Horspool and H.C. Ho. Partial redundancy elimination driven by a cost-benefit analysis. Proceedings of 8th Israeli Conference on Computer Systems and Software Engineering, pages 111--118, June 1997.

No context found.

R. Nigel Horspool and H. C. Ho. Partial redundancy elimination driven by a costbenefit analysis. In Proceedings of 8th Israeli Conference on Computer Systems and Software Engineering (ICSSE'97), pages 111--118, Herzliya, Israel, June 1997. IEEE Computer Society.

No context found.

R. Horspool and H. Ho. Partial redundancy elimination driven by a costbene t analysis, 1997.

No context found.

R. Nigel Horspool and H. C. Ho, Partial redundancy elimination driven by a cost-benefit analysis, Proceedings of 8th Israeli Conference on Computer Systems and Software Engineering (ICSSE'97) (Herzliya, Israel), IEEE Computer Society, June 1997, pp. 111--118.

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