article

Systematic search within an optimisation space based on Unified Transformation Framework

Authors:

Grigori FursinAuthors Info & Claims

International Journal of Computational Science and Engineering, Volume 4, Issue 2

Pages 102 - 111

https://doi.org/10.1504/IJCSE.2009.027002

Published: 01 July 2009 Publication History

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.

References

[1]

Adl-Tabatabai, A., Cierniak, M., Lueh, G., Parakh, V.M. and Stichnoth, J.M. (1998) 'Fast, effective code generation in a just-in-time Java compiler', Proc. 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, pp.280-190.

Digital Library

[2]

Alpern, B., Cocchi, A., Lieber, D., Mergen, M. and Sarkar, V. (1999) 'Jalapeno - a compiler-supported Java virtual machine for servers', Proc. Workshop on Compiler Support for Software System (WCSSS), Atlanta, USA, pp.1-11.

[3]

Bastoul, C., Cohen, A., Girbal, S., Sharma, S. and Temam, O. (2003) 'Putting polyhedral loop transformations to work', Proc. Workshop on Languages and Compilers for Parallel Computing (LCPC), College Station, TX, USA, pp.209-225.

[4]

Bik, A. and Gannon, D. (1997) 'Javar: a prototype Java reconstructing compiler', Concurrency, Practice and Experience, Vol. 9, No. 11, pp.1-42.

[5]

Bodin, F., Kisuki, T., Knijnenburg, P., O'Boyle, M. and Rohou, E. (1998) 'Iterative compilation in a non-linear optimisation space', Proc. ACM Workshop on Profile and Feedback Directed Compilation, Organized in conjunction with PACT'98, Paris, France, pp.1-10.

[6]

Bull, M., Smith, L., Westhead, M., Henty, D. and Davey, R. (2000) 'A benchmark suite for high performance Java', Concurrency, Practice and Experience, Vol. 12, pp.375-388.

[7]

Cohen, A., Girbal, S. and Temam, O. (2004) 'A polyhedral approach to ease the composition of program transformations', Proc. Europar International Conference on Parallel and Distributed Computing (Europar), France, pp.292-303.

[8]

Cooper, K., Grosul, A., Harvey, T., Reeves, S., Subramanian, D., Torzon, L. and Waterman, T. (2004) 'Exploring the structure of the space of compilation sequences using randomized search algorithms', Proc. 2004 Los Alamos Computer Science Institute (LACSI) Symposium, Santa Fe, USA, pp.135-151.

[9]

Franke, B., O'Boyle, M., Thomson, J. and Fursin, G. (2005) 'Probabilistic source-level optimisation of embedded programs', Proc. 2005 Conference on Languages, Compilers and Tools for Embedded Systems (LCTES).

Digital Library

[10]

Fursin, G. (2004) Iterative Compilation and Performance Prediction for Numerical Applications, PhD Thesis, School of Informatics, The University of Edinburgh, Edinburgh, UK.

[11]

Fursin, G., Cohen, A., O'Boyle, M. and Temam, O. (2005) 'A practical method for quickly evaluating program optimizations', Proc. 1st International Conference on High Performance Embedded Architectures and Compilers (HiPEAC), LNCS-3793, Springer Verlag, Barcelona, Spain, pp.29-46.

Digital Library

[12]

Fursin, G., O'Boyle, M. and Knijnenburg, P. (2002) 'Evaluating iterative compilation', Proc. 15th Workshop on Languages and Compilers for Parallel Computers (LCPC), College Park, MD, USA, pp.362-376.

Digital Library

[13]

Kelly, W. and Pugh, W. (1993a) A Framework for Unifying Reordering Transformations, Technical Report of Univ. of Maryland, CS-TR-3193, College Park, MD, USA.

Digital Library

[14]

Kelly, W. and Pugh, W. (1993b) Determining Schedules Based on Performance Estimation, Technical Report of Univ. of Maryland, CS-TR-3108, College Park, MD, USA.

Digital Library

[15]

Kennedy, K. and Allen, R. (2002) Optimizing Compilers for Modern Architecture, A Dependence-Based Approach, Morgan Kaufmann, San Francisco, USA.

Digital Library

[16]

Kisuki, T., Knijnenburg, P., O'Boyle, M., Bodin, F. and Wijshoff, H. (1999) 'A feasibility study in iterative compilation', Proc. International Symposium of High Performance Computing (ISHPC), Lecture Notes in Computer Science, Vol. 1615, Kyoto, Japan, pp.121-132.

Digital Library

[17]

Long, S. and O'Boyle, M. (2001) 'Towards an adaptive Java optimising compiler: an empirical evaluation of program transformations', Proc. 3rd Workshop on Java for High Performance Computing, Sorrento, Italy, pp.1-10.

[18]

Long, S. and O'Boyle, M. (2004) 'Adaptive Java optimisation using instance-based learning', Proc. 18th ACM International Conference for Supercomputing (ICS), St. Malo, France, pp.237-246.

Digital Library

[19]

Long, S. (2004) Adaptive Java Optimisation using Machine Learning Techniques, PhD Thesis, School of Informatics, The University of Edinburgh, Edinburgh, UK.

[20]

Mitchell, T. (1997) Machine Learning, McGraw-Hill, Columbus, OH, USA.

Digital Library

[21]

Moreira, J., Midkiff, S. and Gupta, M. (1998) 'From flops to megaflops: java for techincal computing', Proc. 11st International Workshop on Languages and Compilers for Parallel Computing (LCPC), Chapel Hill, NC, USA, pp.1-17.

Digital Library

[22]

Nisbet, A. (2001) 'Towards retargettable compilers - feedback directed compilation using genetic algorithm', Proc. 9th International Workshop on Compilers for Parallel Computers (CPC), Edinburgh, UK, pp.45-56.

[23]

Parello, D., Temam, O. and Verdun, J. (2002) 'On increasing architecture awareness in program optimizations to bridge the gap between peach and sustained processor performance? Matrix-multiply revisited', Proc. SuperComputing, Baltimore, MD, USA, pp.1-11.

Digital Library

[24]

Pinkers, R., Knijnenburg, P., Haneda, M. and Wishoff, H. (2004) 'Statistical selection of compiler options', Proc. 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS), Netherland, pp.494-501.

Digital Library

[25]

Shirazi, J. (2002) Java Performance Tuning, 2nd ed., O'Reilly, Sebastopol, CA, USA.

Digital Library

[26]

Triantafyllis, S., Vachharajani, M., Vachharajani, N. and August, D. (2003) 'Compiler optimisation-space exploration', Proc. 2003 International Symposium on Code Generation and Optimisation (CGO), San Francisco, USA, pp.204-215.

Digital Library

Cited By

Ganser SGrösslinger ASiegmund NApel SLengauer C(2017)Iterative Schedule Optimization for Parallelization in the Polyhedron ModelACM Transactions on Architecture and Code Optimization10.1145/310948214:3(1-26)Online publication date: 22-Aug-2017
https://dl.acm.org/doi/10.1145/3109482
Pouchet LBastoul CCohen ACavazos J(2008)Iterative optimization in the polyhedral modelACM SIGPLAN Notices10.1145/1379022.137559443:6(90-100)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1379022.1375594
Pouchet LBastoul CCohen ACavazos JGupta RAmarasinghe S(2008)Iterative optimization in the polyhedral modelProceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1375581.1375594(90-100)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375581.1375594
Show More Cited By

Recommendations

Adaptive java optimisation using instance-based learning
ICS '04: Proceedings of the 18th annual international conference on Supercomputing

This paper describes a portable,machine learning-based approach to Java optimisation. This approach uses an instance-based learning scheme to select good transformations drawn from Pugh 's Unified Transformation Framework [11]. This approach was ...
Iterative optimization in the polyhedral model: part ii, multidimensional time
PLDI '08

High-level loop optimizations are necessary to achieve good performance over a wide variety of processors. Their performance impact can be significant because they involve in-depth program transformations that aim to sustain a balanced workload over the ...
Iterative optimization in the polyhedral model: part ii, multidimensional time
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation

High-level loop optimizations are necessary to achieve good performance over a wide variety of processors. Their performance impact can be significant because they involve in-depth program transformations that aim to sustain a balanced workload over the ...

Comments

Information & Contributors

Information

Published In

cover image International Journal of Computational Science and Engineering

International Journal of Computational Science and Engineering Volume 4, Issue 2

July 2009

62 pages

ISSN:1742-7185

EISSN:1742-7193

Issue’s Table of Contents

Publisher

Inderscience Publishers

Geneva 15, Switzerland

Publication History

Published: 01 July 2009

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ganser SGrösslinger ASiegmund NApel SLengauer C(2017)Iterative Schedule Optimization for Parallelization in the Polyhedron ModelACM Transactions on Architecture and Code Optimization10.1145/310948214:3(1-26)Online publication date: 22-Aug-2017
https://dl.acm.org/doi/10.1145/3109482
Pouchet LBastoul CCohen ACavazos J(2008)Iterative optimization in the polyhedral modelACM SIGPLAN Notices10.1145/1379022.137559443:6(90-100)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1379022.1375594
Pouchet LBastoul CCohen ACavazos JGupta RAmarasinghe S(2008)Iterative optimization in the polyhedral modelProceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1375581.1375594(90-100)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375581.1375594
Pouchet LBastoul CCohen AVasilache N(2007)Iterative Optimization in the Polyhedral ModelProceedings of the International Symposium on Code Generation and Optimization10.1109/CGO.2007.21(144-156)Online publication date: 11-Mar-2007
https://dl.acm.org/doi/10.1109/CGO.2007.21

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents