A compiler scheme for reusing intermediate computation results

International Symposium on Code Generation and Optimization, CGO

Volumn , Issue , 2004, Pages 277-288

  Ding, Yonghua ^a   Li, Zhiyuan ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE SEGMENTS; COMPILER SCHEMES; MEMORY LOCATION; RUN TIME;

COMPUTATIONAL METHODS; ENERGY UTILIZATION; GAME THEORY; INFORMATION ANALYSIS; STORAGE ALLOCATION (COMPUTER); TABLE LOOKUP;

PROGRAM COMPILERS;

EID: 3042606562     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. GNU Go. http://www.gnu.org/software/gnugo/gnugo.html.
2. Intel Strong ARM SA-1110 Microprocessor Developer's Manual. October 2001.
3. B. Calder, P. Feller, and A. Eustace. Value profiling. Proc. of the 30th Int. Symp. on Microarchitecture, pages 259-269, December 1997.
4. D. Citron and D. Feitelson. Hardware memoization of mathematical and trigonometric functions. Technical Report, Hebrew University of Jerusalem, March 2000.
5. D. Connors, H. Hunter, B. Cheng, and W. Hwu. Hardware support for dynamic activation of compiler-directed computation reuse. Proc. of the 9th Int. Conf. on Architecture Support for Programming Languages and Operating Systems, November 2000.
6. D. Connors and W. Hwu. Compiler-directed dynamic computation reuse: Rationale and initial results. Proc. of 32nd Int. Symp. on Microarchitecture, pages 158-169, November 1999.
7. M. Das. Unification-based pointer analysis with directional assignments. Proc. of the 2000 ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 35-46, June 2000.
8. M. Guthaus, J. Ringenberg, D. Ernst, T. Austin, T. Mudge, and R. Brown. Mibench: A free, commercially representative embedded benchmark suite. IEEE 4th Annual Workshop on Workload Characterization, pages 3-14, December 2001.
9. J. Huang and D. Lilja. Exploiting basic block value locality with block reuse. In The 5th Int. Symp. on High-Performance Computer Architecture, January 1999.
10. J. Huang and D. Lilja. Balancing reuse opportunities and performance gains with sub-block value reuse. Technical Report, University of Minnesota, February 2002.
11. B. Jenkins. A hash function for hash table lookup. Dr. Dobb's Journal, September 1997.
12. C. Lee, M. Potkonjak, and W. Mangione-Smith. Media-bench: A tool for evaluating and synthesizing multimedia and communications systems. Proc. of the 30th Int. Symp. on Microarchitecture, pages 330-335, December 1997.
13. D. Michie. Memo functions and machine learning. Nature, 218:19-22, April 1968.
14. H. Pande, W. Landi, and B. Ryder. Interprocedural def-use associations for c systems with single level pointers. IEEE Transactions on Software Engineering, 20(5), May 1994.
15. S. Richardson. Exploiting trivial and redundant computation. Proc. of the 11th Symp. on Computer Arithmetic, pages 220-227, July 1993.
16. S. Sastry, R. Bodik, and J. Smith. Characterizing coarse-grained reuse of computation. 3rd ACM Workshop on Feedback Directed and Dynamic Optimization, December 2000.
17. A. Sodani and G. Sohi. Dynamic instruction reuse. Proc. of the 24th Int. Symp. on Computer Architecture, pages 194-205, June 1997.
18. A. Sodani and G. Sohi. Understanding the differences between value prediction and instruction reuse. Proc. of the 31th Int. Symp. on Computer Architecture, pages 205-215, December 1998.