Optimized Polynomial Evaluation with Semantic Annotations

03/04/2016
by   Daniel Rubio Bonilla, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Solving polynomial equations and applications

These notes accompany an introductory lecture given by the author at the...
research
06/27/2022

Simplifying Semantic Annotations of SMCalFlow

SMCalFlow is a large corpus of semantically detailed annotations of task...
research
08/03/2020

OFAI-UKP at HAHA@IberLEF2019: Predicting the Humorousness of Tweets Using Gaussian Process Preference Learning

Most humour processing systems to date make at best discrete, coarse-gra...
research
09/05/2016

Automatic Library Generation for Modular Polynomial Multiplication

Polynomial multiplication is a key algorithm underlying computer algebra...
research
06/26/2019

A Modular and Extensible Software Architecture for Particle Dynamics

Creating a highly parallel and flexible discrete element software requir...
research
11/11/2020

Guiding user annotations for units-of-measure verification

This extended abstract reports on previous work of the CamFort project i...

Please sign up or login with your details

Forgot password? Click here to reset