Modular Resultant Algorithm for Graphics Processors

Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algorithm first maps the polynomials to a prime field. Then, each modular image is processed individually. The GPU evaluates the polynomials at a number of points and computes univariate modular resultants in parallel. The remaining “combine” stage of the algorithm is executed sequentially on the host machine. Porting this stage to the graphics hardware is an object of ongoing research. Our algorithm is based on an efficient modular arithmetic from [6]. With the theory of displacement structure we have been able to parallelize the resultant algorithm up to a very fine scale suitable for realization on the GPU. Our benchmarks show a substantial speed-up over a host-based resultant algorithm [11] from CGAL (www.cgal.org). Key words: polynomial resultants, modular algorithm, parallel computations, graphics ha...

• Type: Conference
• Year: 2010
• Where: ICA3PP
• Authors: Pavel Emeliyanenko
• Keywords: Algorithm, Algorithm first Maps, Distributed And Parallel Computing, ICA3PP 2010, Polynomial