Abstract
In iterative compilation we search for the best program transformations by profiling many variants and selecting the one with the shortest execution time. Since this approach is extremely time consuming, we discuss in this paper how to incorporate static models. We show that a highly accurate model as a filter to profiling can reduce the number of executions by 50%. We also show that using a simple model to rank transformations and profiling only those with highest ranking can reduce the number of executions even further, in case we have a limited number of profiles at our disposal. We conclude that a production compiler might perform best using the last approach.
Chapter PDF
Similar content being viewed by others
References
J. Auslander, M. Philipose, Chambers, S. J. Eggers, and N. Bershad. Fast, effective dynamic compilation. In Proc. PLDI, pages 149–159, 1996.
J. Bilmes, K. Asanović, C. W. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology. In Proc. ICS, pages 340–347, 1997.
F. Bodin, T. Kisuki, P. M. W. Knijnenburg, M. F. P. O’Boyle, and E. Rohou. Iterative compilation in a non-linear optimisation space. In Proc. Workshop on Profile and Feedback Directed Compilation, 1998.
S. Carr. Combining optimization for cache and instruction level parallelism. In Proc. PACT, pages 238–247, 1996.
S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In Proc. PLDI, pages 279–290, 1995.
P. Diniz and M. Rinard. Dynamic feedback: An effective technique for adaptive computing. In Proc. PLDI, pages 71–84, 1997.
T. Kisuki, P. M. W. Knijnenburg, and M. F. P. O’Boyle. Combined selection of tile sizes and unroll factors using iterative compilation. In Proc. PACT, pages 237–246, 2000.
M. S. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proc. ASPLOS, pages 63–74, 1991.
B. Singer and M. Veloso. Learning to predict performance from formula modeling and training data. In Proc. Conf. on Machine Learning, 2000.
M. D. Smith. Overcoming the challenges to feedback-directed optimization. In Proc. Dynamo, 2000.
M. J. Voss and R. Eigenmann. ADAPT: Automated de-coupled adaptive program transformation. In Proc. ICPP, 2000.
R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. In Proc. Alliance, 1998.
M. E. Wolf, D. E. Maydan, and D.-K. Chen. Combining loop transformations considering caches and scheduling. Int’l. J. of Parallel Programming, 26(4):479–503, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knijnenburg, P.M.W., Kisuki, T., Gallivan, K. (2001). Cache Models for Iterative Compilation. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive