Post-compilation optimization for multiple gains with pattern matching

ACM SIGPLAN Notices

Volumn 40, Issue 12, 2005, Pages 14-23

  Kumar, Rajeev ^a   Gupta, Amit ^a   Pankaj, B S ^a   Ghosh, Mrinmoy ^a   Chakrabarti, P P ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Instruction set FSM; Pattern matching; Peephole optimization; Post compilation optimization

Indexed keywords

BINARY SEQUENCES; CODES (SYMBOLS); OPTIMIZATION; PATTERN MATCHING; PROGRAM PROCESSORS;

INSTRUCTION SET FSM; PEEPHOLE OPTIMIZATION; POST-COMPILATION OPTIMIZATION;

PROGRAM COMPILERS;

EID: 33745185794     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1117303.1117306     Document Type: Article

References (31)

1. B. D. Bus, D. Kastner, D. Chanet, L. V. Put, and B. D. Sutter. Post-pass compaction techniques. Communications of the ACM, 46(8): 41-46, August 2003.
2. B. D. Bus, B. D. Sutter, L. V. Put, D. Chanet, and K. D. Bosschere. Link-time optimization of ARM binaries. ACM SIGPLAN Notices, 39(6): 211-220, June 2004.
3. J. W. Davidson. Automatic generation of peephole optimizations. ACM SIGPLAN Notices, 39(4): 104-111, April 2004.
4. J. W. Davidson and C. W. Fraser. The design and application of a retargelable peephole optimizer. ACM Trans. Programming Languages & Systems, 2(2): 191-202, April 1980.
5. J. W. Davidson and C. W. Fraser. Code selection through object code optimization. ACM Trans. Programming Languages & Systems, 6(4):505-526, October 1984.
6. S. Debray and W. Evans. Profile-guided code compression. ACM SIGPLAN Notices, 37(5): 95-105, May 2002.
7. S. K. Debray and W. Evans, R. Muth, and B. D. Sutter. Compiler techniques for code compaction. ACM Trans. Programming Languages & Systems, 22(2): 378 -415, March 2000.
8. J. Ernst, W. Evans, C. Fraser, S. Lucco, and T. Proebsting. Code compression. In Proc. PLDI, pages 358-365, June 1997.
9. M. Franz. Adaptive compression of synlax trees and iterative dynamic code optimization: Two basic technologies for mobile object systems. In J. Vitek and C. Tschudin (Ed.), Mobile Object Systems: Towards the Programmable Internet, LNCS 1222: 263-276. Springer-Verlag, Feb. 1997.
10. M. Franz and T. Kistler. Slim binaries. Communications of ACM, 40(12): 87-94, Dec. 1997.
11. C. W. Fraser. Automatic inference of models for statistical code compression. In Proc. PLDI, pages 242-246, May 1999.
12. C. W. Fraser, E. W. Myers, and A. L. Wendt. Analyzing and compressing assembly code. In Proc. ACM Symp. Compiler Construction, 19: 117-121, June 1984.
13. M. Ghosh. Compiler Backend Generation and a Post-Compilation Optimization Technique for Extensible Architecture. MS Thesis. Computer Sc. & Engineering Department, IIT Kharagpur, 2004.
14. T. M. Kemp, R. M. Montoye, J. D. Harper, J. D. Palmer, and D. J. Auerbach. A decompression core for PowerPC. IBM J. Research and Development, 42(6), Nov. 1998.
15. P. B. Kessler. Discovering machine-specific code improvements. In Proc. Symp. Compiler Construction. ACM SIGPLAN Notices, 21(7): 249-254, July 1986.
16. R. R. Kessler. Peep: An architectural description driven peephole optimizer. ACM SIGPLAN Notices, 19(6): 106-110, June 1984.
17. K. D. Kissell. MIPS16: High-density MIPS for the embedded market. In Proc. Real Time Systems (RTS97), 1997.
18. D. A. Lamb. Construction of a peephole optimizer. Software - Practice and Experience, 11(6): 638-647, June 1981
19. S. Lee, A. Ermedahl, S. L. Min, and N. Chang. An accurate instruction-level energy consumption model for embedded RISC processors. ACM SIGPLAN Notices, 36(8): 1-10, August 2001.
20. H. Lekatsas, J. Henkel, V. Jakkula, and S. Chakradhar. A unified architecture for adaptive compression of data and code on embedded systems. In Proc. VLSI Design Conf.: 117-123, January 2005. IEEE CS Press.
21. R. Leupers. Compiler design issues for embedded processors. IEEE Design & Test of Computers, 19(4): 51-58, July-Aug. 2002.
22. McKeeman. Peephole optimization. Communications of the ACM, 8(7): 443-444, July 1965.
23. B. J. McKenzie. Fast peephole optimization techniques. Software - Practice & Experience, 19(12): 1151-1162, December, 1989.
24. S. Nystrom, J. Runeson, and J. Sjodin. Code compression techniques for embedded systems, 2000.
25. B. S. Pankaj and A. Gupta. Porting. NET and a Post Compilation Optimization Technique. B. Tech. Project Report. Computer Sc. & Engineering Dept., IIT Kharagpur, May 2004.
26. W. Pugh. Compressing Java class files. In Proc. PLDI, pages 247-258, May 1999.
27. D. Spinellis. Declarative peephole optimization using string pattern matching. ACM SIGPLAN Notices, 34(2):47-50, February 1999.
28. B. D. Sutter, B. D. Bus, K. D. Bosschere, and S. Debray. Combining global code and data compaction. ACM SIGPLAN Notices, 36(8): 29-38, August 2001.
29. A. S. Tanenbaum, H. V. Staveren, and J. W. Stevenson. Using peephole optimization on intermediate code. ACM Trans. Programming Languages & Systems, 4(1): 21-36, January 1982
30. M. Zastre. Compacting object code via parameterized procedural abstraction. Master's thesis, University Victoria, 1995.
31. M. Zhao, B. Childers, and M. L. Soffa. Predicting the impact of optimizations for embedded systems. In Proc. LCTES-03, San Diego, CA. ACM SIGPLAN Notices, 38(6): 1-11, June 2003.