Optimal Algorithms for Parallel Polynomial Evaluation

Journal of computer and system sciences (Print) Pub Date : 1971-10-13 DOI:10.1109/SWAT.1971.23

I. Munro, M. Paterson

引用次数: 98

Abstract

Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log"2k], an algorithm given is within one time unit of optimality.

查看原文本刊更多论文

并行多项式求值的最优算法

给出了在具有k个独立算术处理器的假设计算机上求多项式的算法。结果表明，当待求多项式的阶数超过k[log 2k]时，给出的算法在一个时间单位内达到最优性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of computer and system sciences (Print)

自引率

0.00%

发文量