The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2004)
Antibes Juan-les-Pins, France
Sept. 29, 2004 to Oct. 3, 2004
ISSN: 1089-795X
ISBN: 0-7695-2229-7
pp: 17-28
Pen-Chung Yew , University of Minnesota
Jin Lin , University of Minnesota
Wei-Chung Hsu , University of Minnesota
Roy Dz-Ching Ju , Intel Corporation, Santa Clara, CA
Tin-Fook Ngai , Intel Corporation, Santa Clara, CA
ABSTRACT
A general framework that integrates both control and data speculation using alias profiling and/or compiler heuristic rules has shown to improve SPEC2000 performance on Itanium systems. However, speculative optimizations require check instructions and recovery code to ensure correct execution when speculation fails at runtime. How to generate check instructions and their associated recovery code efficiently and effectively is an issue yet to be well studied. Also, it is very important that the recovery code generated in the earlier phases integrate gracefully in the later optimization phases. At the very least, it should not hinder later optimizations, thus, ensuring overall performance improvement. This paper proposes a framework that uses an if-block structure to facilitate check instructions and recovery code generation for general speculative optimizations. It allows speculative instructions and their recovery code generated in the early compiler optimization phases to be integrated effectively with the subsequent optimization phases. It also allows multi-level speculation for multi-level pointers and multi-level expression trees to be handled with no additional complexity. The proposed recovery code generation framework has been implemented in the Open Research Compiler (ORC).
INDEX TERMS
null
CITATION
Pen-Chung Yew, Jin Lin, Wei-Chung Hsu, Roy Dz-Ching Ju, Tin-Fook Ngai, "A Compiler Framework for Recovery Code Generation in General Speculative Optimizations", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 17-28, 2004, doi:10.1109/PACT.2004.10013
84 ms
(Ver 3.3 (11022016))