A Heuristic Search Algorithm Based on Unified Transformation Framework (2005)
| Venue: | In ICPPW ’05: Proceedings of the 2005 International Conference on Parallel Processing Workshops (ICPPW’05 |
| Citations: | 10 - 2 self |
BibTeX
@INPROCEEDINGS{Long05aheuristic,
author = {Shun Long and Grigori Fursin},
title = {A Heuristic Search Algorithm Based on Unified Transformation Framework},
booktitle = {In ICPPW ’05: Proceedings of the 2005 International Conference on Parallel Processing Workshops (ICPPW’05},
year = {2005},
pages = {137--144},
publisher = {IEEE Computer Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Modern compilers have limited ability to exploit the performance improvement potential of complex transformation compositions. This is due to the ad-hoc nature of different transformations. Various frameworks have been proposed to provide a unified representation of different transformations, among them is Pugh's Unified Transformation Framework (UTF)[10]. It presents a unified and systematic representation of iteration reordering transformations and their arbitrary combination, which results in a large and complex optimisation space for a compiler to explore. This paper presents a heuristic search algorithm capable of efficiently locating good program optimisations within such a space. Preliminary experimental results on Java show that it can achieve an average speedup of 1.14 on Linux+Celeron and 1.10 on Windows+PentiumPro, and more than 75% of the maximum performance available can be obtained within 20 evaluations or less.
