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

Optimal algorithms for parallel polynomial evaluation

โœ Scribed by Ian Munro; Michael Paterson

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
363 KB
Volume
7
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

โœฆ Synopsis

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[Iog2 k], an algorithm given is within one time unit of optimality.

๐Ÿ“œ SIMILAR VOLUMES

Optimal Parallel Algorithms for Quadtree
Optimal Parallel Algorithms for Quadtree Problems
โœ S. Kasif ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science โš– 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc

Optimal Parallel Algorithms for Computer
Optimal Parallel Algorithms for Computer Vision Problems
โœ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used