The actual complexity of parallel evaluation of low degree polynomials (Q582800): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
The authors consider several sequential and parallel algorithms for the evaluation of polynomials of low degree with particular emphasis on those that are used frequently in computer graphics. A complete accounting of computation times for the speedup and efficiency of these algorithms is reported. The results are compared to standard estimates of these quantities for single and multiprocessor using classical complexity theory. A simulator which is configurable to several parallel architecture is used to provide validation of the results obtained. | |||
| Property / review text: The authors consider several sequential and parallel algorithms for the evaluation of polynomials of low degree with particular emphasis on those that are used frequently in computer graphics. A complete accounting of computation times for the speedup and efficiency of these algorithms is reported. The results are compared to standard estimates of these quantities for single and multiprocessor using classical complexity theory. A simulator which is configurable to several parallel architecture is used to provide validation of the results obtained. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65D20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65Y05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4131518 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parallel algorithms | |||
| Property / zbMATH Keywords: parallel algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
evaluation of polynomials | |||
| Property / zbMATH Keywords: evaluation of polynomials / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computer graphics | |||
| Property / zbMATH Keywords: computer graphics / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complexity theory | |||
| Property / zbMATH Keywords: complexity theory / rank | |||
Normal rank | |||
Revision as of 19:13, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The actual complexity of parallel evaluation of low degree polynomials |
scientific article |
Statements
The actual complexity of parallel evaluation of low degree polynomials (English)
0 references
1990
0 references
The authors consider several sequential and parallel algorithms for the evaluation of polynomials of low degree with particular emphasis on those that are used frequently in computer graphics. A complete accounting of computation times for the speedup and efficiency of these algorithms is reported. The results are compared to standard estimates of these quantities for single and multiprocessor using classical complexity theory. A simulator which is configurable to several parallel architecture is used to provide validation of the results obtained.
0 references
parallel algorithms
0 references
evaluation of polynomials
0 references
computer graphics
0 references
complexity theory
0 references
