Ewart, TimotheeCremonesi, FrancescoSchurmann, FelixDelalondre, Fabien2020-10-212020-10-212020-10-212020-09-0110.1145/3408893https://infoscience.epfl.ch/handle/20.500.14299/172636WOS:000575731600008The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. In addition, we have completed this work with a factorization method, which is surprisingly neglected in the literature. This work focuses on out-of-order Intel processors, amongst others, of which computational units are available. Moreover, we applied ourwork on the elementary function ex that requires, in the current implementation, an evaluation of a polynomial of degree 10 for a satisfying precision and performance. Our results show that the factorization scheme is the fastest in benchmarks, and that latency and throughput are intrinsically dependent on each other on superscalar architecture.Computer Science, Software EngineeringMathematics, AppliedComputer ScienceMathematicspolynomial evaluationcompute unitssuperscalar architectureelementary functiontext::journal::journal article::research article