๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Data parallel evaluation of univariate polynomials by the Knuth-Eve algorithm

โœ Scribed by R.E. Overill; S. Wilson


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
797 KB
Volume
23
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

โœฆ Synopsis


The performance of the Knuth-Eve algorithm for data parallel evaluation of univariate polynomials of degree 8, 16 and 32 has been systematically compared with that of the classical Newton-Homer algorithm using three vector processors and three processor arrays. Significant performance improvements have been observed beyond a critical problem size, as predicted by theory. The practical implications of this result for large-scale computations involving function approximation are outlined. 0 1997 Elsevier Science B.V.


๐Ÿ“œ SIMILAR VOLUMES