article

Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm

Authors:

V. K. Paleri,

Y. N. Srikant,

P. ShankarAuthors Info & Claims

Science of Computer Programming, Volume 48, Issue 1

Pages 1 - 20

https://doi.org/10.1016/S0167-6423(02)00083-7

Published: 01 July 2003 Publication History

Abstract

We propose a new algorithm for partial redundancy elimination based on the new concepts of safe partial availability and safe partial anticipability. These new concepts are derived by the integration of the notion of safety into the definitions of partial availability and partial anticipability. The algorithm works on flow graphs whose nodes are basic blocks. It is both computationally and lifetime optimal and requires four unidirectional analyses. The most important feature of the algorithm is its simplicity; the algorithm evolves naturally from the new concept of safe partial availability.

References

[1]

{1} A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.

Digital Library

Google Scholar

[2]

{2} F. Chow, A portable machine independent optimizer-design and implementation, Ph.D. Thesis, Dept. of Electrical Engineering, Stanford University, Stanford, Calif., and Technical Report 83-254, Computer Systems Lab., Stanford University, 1983.

Crossref

Google Scholar

[3]

{3} D.M. Dhamdhere, A fast algorithm for code movement optimization, SIGPLAN Notices 23 (10) (1988) 172-180.

Digital Library

Google Scholar

[4]

{4} D.M. Dhamdhere, Practical adaptation of the global optimization algorithm of Morel and Renvoise, ACM TOPLAS 13 (2) (1991) 291-294.

Digital Library

Google Scholar

[5]

{5} D.M. Dhamdhere, U.P. Khedker, Complexity of bidirectional data-flow analysis, in: Conf. Record of 20th ACM Symp. on the Principles of Programming Languages, ACM, New York, 1993 pp. 397-409.

Crossref

Google Scholar

[6]

{6} D.M. Dhamdhere, H. Patil, An elimination algorithm for bidirectional data-flow problems using edge placement, ACM TOPLAS 15 (2) (1993) 312-336.

Digital Library

Google Scholar

[7]

{7} D.M. Dhamdhere, B.K. Rosen, F.K. Zadeck, How to analyse large programs efficiently and informatively, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation '92, ACM SIGPLAN Notices 27(7) (1992) 212-223.

Digital Library

Google Scholar

[8]

{8} V.M. Dhaneshwar, D.M. Dhamdhere, Strength reduction of large expressions, J. Program. Lang. 3 (1995) 95-120.

Google Scholar

[9]

{9} K.H. Dreshler, M.P. Stadel, A variation of Knoop, Rüthing, and Steffen's lazy code motion, ACM SIGPLAN Notices 28 (5) (1993) 29-38.

Digital Library

Google Scholar

[10]

{10} J. Knoop, O. Rüthing, B. Steffen, Lazy code motion, ACM SIGPLAN Notices 27 (7) (1992) 224-234.

Digital Library

Google Scholar

[11]

{11} J. Knoop, O. Rüthing, B. Steffen, Optimal code motion: theory and practice ACM TOPLAS 16 (4) (1994) 1117-1155.

Digital Library

Google Scholar

[12]

{12} E. Morel, C. Renvoise, Global optimization by suppression of partial redundancies, Comm. ACM 22 (2) (1979) 96-103.

Digital Library

Google Scholar

[13]

{13} V.K. Paleri, Y.N. Srikant, P. Shankar, A simple algorithm for partial redundancy elimination, ACM SIGPLAN Notices 33 (12) (1998) 35-43.

Digital Library

Google Scholar

Cited By

View all

Tian RQiu JZhao ZLiu XRen BKandemir MJimborean AMoseley T(2019)Transforming query sequences for high-throughput B+ tree processing on many-core processorsProceedings of the 2019 IEEE/ACM International Symposium on Code Generation and Optimization10.5555/3314872.3314887(96-108)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.5555/3314872.3314887
Abdildin Y(2019)Ternary-Decimal Exclusion Algorithm for Multiattribute Utility FunctionsComputational Science – ICCS 201910.1007/978-3-030-22750-0_22(282-292)Online publication date: 12-Jun-2019
https://dl.acm.org/doi/10.1007/978-3-030-22750-0_22
Saabas AUustalu THatcliff JGlück Rde Moor O(2008)Proof optimization for partial redundancy eliminationProceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/1328408.1328422(91-101)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328408.1328422

Index Terms

Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

A simple algorithm for partial redundancy elimination

Partial redundancy elimination was originally formulated as a bidirectional, bit-vector, data-flow analysis problem by Morel and Renvoise. Dhamdhere improved the original algorithm using the concept of edge placement. Knoop, Rüthing, and Steffen ...
A practical adoption of partial redundancy elimination

Partial redundancy elimination is a powerful optimization technique which needs little introduction. The original formulation was introduced in 1979 by Morel and Renvoise. More efficient formulations have since been offered.

We introduce an ever more ...
A lifetime optimal algorithm for speculative PRE

A lifetime optimal algorithm, called MC-PRE, is presented for the first time that performs speculative PRE based on edge profiles. In addition to being computationally optimal in the sense that the total number of dynamic computations for an expression ...

Comments

Information & Contributors

Information

Published In

cover image Science of Computer Programming

Science of Computer Programming Volume 48, Issue 1

July 2003

79 pages

ISSN:0167-6423

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 July 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tian RQiu JZhao ZLiu XRen BKandemir MJimborean AMoseley T(2019)Transforming query sequences for high-throughput B+ tree processing on many-core processorsProceedings of the 2019 IEEE/ACM International Symposium on Code Generation and Optimization10.5555/3314872.3314887(96-108)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.5555/3314872.3314887
Abdildin Y(2019)Ternary-Decimal Exclusion Algorithm for Multiattribute Utility FunctionsComputational Science – ICCS 201910.1007/978-3-030-22750-0_22(282-292)Online publication date: 12-Jun-2019
https://dl.acm.org/doi/10.1007/978-3-030-22750-0_22
Saabas AUustalu THatcliff JGlück Rde Moor O(2008)Proof optimization for partial redundancy eliminationProceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/1328408.1328422(91-101)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328408.1328422

Abstract

References

Cited By

Index Terms

Recommendations

A simple algorithm for partial redundancy elimination

A practical adoption of partial redundancy elimination

A lifetime optimal algorithm for speculative PRE

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations