The actual complexity of parallel evaluation of low degree polynomials

We 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 resu...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Parallel computing 1990, Vol.13 (1), p.73-83
Hauptverfasser:	Leach, Ronald J, Atogi, O.Michael, Stephen, Razeyah R
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences complexity results computer graphics Computer science control theory systems Exact sciences and technology Parallel evaluation of low degree polynomials performance analysis Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We 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 multi-processors using classical complexity theory. A simulator which is configurable to several parallel architectures is used to provide validation of the results obtained.
ISSN:	0167-8191 1872-7336
DOI:	10.1016/0167-8191(90)90120-X