Systematic search within an optimisation space based on Unified Transformation Framework
by Shun Long, Grigori Fursin
International Journal of Computational Science and Engineering (IJCSE), Vol. 4, No. 2, 2009

Abstract: Modern compilers have limited ability to exploit the performance improvement potential of complex transformation compositions due to their ad-hoc nature. Unified Transformation Framework (Kelly and Pugh, 1993a) provides a unified representation of different iteration reordering transformations. It results in a large and complex space to explore. This paper presents a heuristic search algorithm capable of efficiently locating good optimisations within this space. Preliminary experimental results on Java show that it can achieve an average speedup of 1.14 and 1.10 on two different platforms, and more than 75% of the maximum performance available can be obtained within 20 evaluations.

Online publication date: Sun, 12-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com