Evaluation of Parallel Computations of Gr¨obner and Involutive Bases on the Massive SMP Computer

Cover Page

Cite item


In previous papers author presented realizations of two different approaches to parallelization of computation of Gr¨obner and involutive bases of polynomial systems with benchmarking on the 8-cores SMP computer: reduction-level parallelism with coefficients of polynomials in Z-ring and basis-level parallelism using modular basis computation and lifting. In this work further development of this algorithms described, benchmarking results and maximal speedup achieved on the massive 32-cores computer presented, scalability differences of algorithms investigated.

About the authors

D A Yanovich

Joint Institute for Nuclear Research

Email: yan@jinr.ru
Laboratory of Information Technologies


Copyright (c) 2014 Янович Д.А.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies