article

Value reuse optimization: reuse of evaluated math library function calls through compiler generated cache

Author:

K. V. Seshu KumarAuthors Info & Claims

ACM SIGPLAN Notices, Volume 38, Issue 8

Pages 60 - 66

https://doi.org/10.1145/944579.944591

Published: 01 August 2003 Publication History

Abstract

Value reuse technique eliminates the redundant evaluation of expressions, using the support of hardware at runtime to eliminate them. The potential performance of a value reuse mechanism not only depends on the number of instances it has eliminated, but as well as on the time spent in detecting the instance to be eliminated. In order to have better value reuse, we move from instruction level reuse to function reuse, so that one can detect more eliminative instances with reasonable effort. This removes the extra time spent on detecting the possibility of instruction execution elimination. The results of the mathematical library functions evaluated can be reused. Since they can be treated as instructions, i,e. functions which do not have side-effects with the application, one can eliminate the function call itself. In this paper, we propose a Technique to re-use the evaluated values for math library functions. Execution time is decreased up to 6%. Reduction in the number of calls due to instrumentation of code for function reuse for math library routines is up to 99% at a particular call-site in the application

References

[1]

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

Digital Library

[2]

Avinash Sodani, Gurindar S. Sohi Dynamic Instruction Reuse Comm, ACM 22(2):96--103, February 1976.

[3]

Mikko H. Lipasti and Christopher B. Wilkerson and John Paul Shen, "Value Locality and Load Value Prediction", Architectural Support for Programming Languages and Operating Systems, 1996. pages 138--147, http://citeseer.nj.nec.com/lipasti96value.html

Digital Library

[4]

Bacon D. F., Graham S. L., Compiler transformations for high-performance computing, ACM Computin Surveys, Vol. 26, No. 4, 345--420, December 1994.

Digital Library

[5]

B. Calder and P. Feller and A. Eustace Value Profiling and Optimization Journal of Instruction Level Parallelism, 1999. http://citeseer.nj.nec.com/calder99value.html

Digital Library

[6]

Jian Huang Improving Processor Performance Through Compiler Assisted Block Reuse Phd Thesis, Univ of Minnesota, Twin Cities, 2000.

Digital Library

[7]

Bodik R., Gupta R., Soffa M. L., Complete removal of redundant expressions Proceeding of the ACM Conference on Programming Language Design and Implementation, 1--14, ACM Press 1998.

Digital Library

[8]

Jian Huang, David J. Lilja Exploring Sub-Block Value Reuse for Superscalar Processors In proceedings of 2000 International Conference on Parallel Architectures and Compilation Techniques (PACT'00) October 15-19, 2001 Philadelphia, Pennsylvania, pg 100.

Digital Library

[9]

John Hughes Lazy Memo-functions In the proceedings of FPCA 1985. pages 129--146.

Digital Library

[10]

Allan Heydon, Roy Levin and Yuan Yu Caching function calls using precise dependencies ACM

Digital Library

[11]

S. E. Richardson. Caching Function Results: Faster arithmetic by avoiding unnecessary computation. Technical Report SMLTR-92-1, Sun Microsystems Laboratories, Spet. 1992

Digital Library

[12]

S. P. Harbison. An architectural alternative to optimizing compilers. In Proc. International Conference on Architectural Support for programming Languages and Operating System(ASPLOS), page 57 65, Mar. 1982.

Digital Library

[13]

D. M. Dhamdhere, H. Patil An elimination algorithm for bi-directional data ow problems using edge placement In Proc. ACM Transactions on Programming Languages and Systems, vol. 15 (1993), 312--336.

Digital Library

[14]

W. Pugh and T. Teitelbaum. Incremental computation via function caching. In conference Record of the 16th Annual Symposium on POPL, pages 315--328, Jan 1989.

Digital Library

[15]

Arun Chauhanachauhan and Ken Kennedy Optimizing Strategies for Telescoping Languages: Procedure Strength Reduction and Procedure in the Proceedings of the 15th ACM International Conference on Supercomputing, June 16-21, 2001, Sorrento, Naples, Italy.

Digital Library

[16]

Torben. Mogensen, Peter Sestoft Partial Evaluation. in Encyclopedia of Computer Science and Technology, pages 247--279, volume 37, year 1997.

[17]

Umut A. Acar, Guy E. Blelloch and Robert Harper Selective Memorization in the proceedings of the POPL'03, January 15-17, 2003.

Digital Library

Cited By

Brandalero Mda Silveira LSouza JBeck A(2018)Accelerating error-tolerant applications with approximate function reuseScience of Computer Programming10.1016/j.scico.2017.05.003165(54-67)Online publication date: Nov-2018
https://doi.org/10.1016/j.scico.2017.05.003
Silveira LBrandalero MSouza JBeck A(2016)The Potential of Accelerating Image-Processing Applications by Using Approximate Function Reuse2016 VI Brazilian Symposium on Computing Systems Engineering (SBESC)10.1109/SBESC.2016.026(122-127)Online publication date: Nov-2016
https://doi.org/10.1109/SBESC.2016.026
Wilcox CStrout MBieman J(2014)An optimization-based approach to lookup table program transformationsJournal of Software: Evolution and Process10.1002/smr.162026:6(533-551)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1002/smr.1620
Show More Cited By

Index Terms

Value reuse optimization: reuse of evaluated math library function calls through compiler generated cache
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Index terms have been assigned to the content through auto-classification.

Recommendations

Performance Enhancement by Eliminating Redundant Function Execution
ANSS '06: Proceedings of the 39th annual Symposium on Simulation

Programs often call the same function with the same arguments, yielding the same results. We call this phenomenon, "function reuse". Previously, we have shown such a behavior for some of the SPEC2000 integer benchmarks using HP ATOM instrumentation ...
Read More
On the effectiveness of flow aggregation in improving instruction reuse in network processing applications
Special issue: Workshop on application specific processors (WASP)

Instruction Reuse is a microarchitectural technique that exploits dynamic instruction repetition to remove redundant computations at run-time. In this paper we examine instruction reuse of integer ALU and load instructions in network processing ...
Read More
Exploiting speculative value reuse using value prediction

Data dependencies between instructions greatly impede instruction-level parallelism. Recently two hardware techniques --- Value Prediction and Value Reuse --- have been proposed to overcome the limits imposed by data dependencies. We introduce a new ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 38, Issue 8

August 2003

67 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/944579

Issue’s Table of Contents

Copyright © 2003 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 2003

Published in SIGPLAN Volume 38, Issue 8

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
279
Total Downloads

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

Other Metrics

View Author Metrics

Citations

Cited By

Brandalero Mda Silveira LSouza JBeck A(2018)Accelerating error-tolerant applications with approximate function reuseScience of Computer Programming10.1016/j.scico.2017.05.003165(54-67)Online publication date: Nov-2018
https://doi.org/10.1016/j.scico.2017.05.003
Silveira LBrandalero MSouza JBeck A(2016)The Potential of Accelerating Image-Processing Applications by Using Approximate Function Reuse2016 VI Brazilian Symposium on Computing Systems Engineering (SBESC)10.1109/SBESC.2016.026(122-127)Online publication date: Nov-2016
https://doi.org/10.1109/SBESC.2016.026
Wilcox CStrout MBieman J(2014)An optimization-based approach to lookup table program transformationsJournal of Software: Evolution and Process10.1002/smr.162026:6(533-551)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1002/smr.1620
Shamir L(2006)Dynamic reuse of subroutine resultsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2006.06.00252:10(603-608)Online publication date: 1-Oct-2006
https://dl.acm.org/doi/10.1016/j.sysarc.2006.06.002

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents