论文信息 - Optimal Algorithms for Parallel Polynomial Evaluation

Optimal Algorithms for Parallel Polynomial Evaluation

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.

J. I. Munro | M. Paterson

[1] David G. Kirkpatrick. On the additions necessary to compute certain functions , 1972, STOC '72.

[2] Yoichi Muraoka,et al. Parallelism exposure and exploitation in programs , 1971 .

[3] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[4] S Winograd,et al. On the number of multiplications required to compute certain functions. , 1967, Proceedings of the National Academy of Sciences of the United States of America.

[5] William S. Dorn,et al. Generalizations of Horner's Rule for Polynomial Evaluation , 1962, IBM J. Res. Dev..

[6] Gerald Estrin,et al. Organization of computer systems: the fixed plus variable structure computer , 1960, IRE-AIEE-ACM '60 (Western).

[7] Gerald Estrin,et al. Organization of Computer Systems-the Fixed Plus Variable Structure Computer , 1899 .