Towards an efficient implementation of a fast algorithm for multipoint polynomial evaluation and its parallel processing

Murao, Hirokazu; Fujise, Tetsuro

doi:10.1145/266670.266680

Search citation statements

Order By: Relevance

Paper Sections

Select...

Proposition1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These timings are also available in the form of plots with Figures 1 and 2 where radix-2 logscales are used on both axes. We found that our implementation does not perform well until degree 2 15 . In degree 2…”

Section: Propositionmentioning

confidence: 82%

See 1 more Smart Citation

On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures

Haque

Mansouri

Maza

2014

Computer Algebra in Scientific Computing

View full text Add to dashboard Cite

Abstract. We propose parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques and targeting many-core GPUs. On those architectures, we demonstrate the importance of adaptive algorithms, in particular the combination of parallel plain arithmetic and parallel FFT-based arithmetic. Experimental results illustrate the benefits of our algorithms.

show abstract

Section: Propositionmentioning

confidence: 82%

“…The span and parallelism overhead of our algorithm are measured considering the many-core machine model of [8]. The paper [15] briefly discusses the parallelization of FFT-based multi-point evaluation without considering parallelism overhead, adaptive algorithms nor reporting on an implementation.…”

Section: Introductionmentioning

confidence: 99%