Optimized Polynomial Evaluation with Semantic Annotations
Programming Languages
2016-03-14 v3 Computation and Language
Abstract
In this paper we discuss how semantic annotations can be used to introduce mathematical algorithmic information of the underlying imperative code to enable compilers to produce code transformations that will enable better performance. By using this approaches not only good performance is achieved, but also better programmability, maintainability and portability across different hardware architectures. To exemplify this we will use polynomial equations of different degrees.
Cite
@article{arxiv.1603.01520,
title = {Optimized Polynomial Evaluation with Semantic Annotations},
author = {Daniel Rubio Bonilla and Colin W. Glass and Jan Kuper},
journal= {arXiv preprint arXiv:1603.01520},
year = {2016}
}
Comments
Part of the Program Transformation for Programmability in Heterogeneous Architectures (PROHA) workshop, Barcelona, Spain, 12th March 2016, 7 pages, LaTeX, 4 PNG figures