On parallel computation of grobner bases
Anton Leykin · Proceedings of the International Conference on Parallel Processing · 2004
We have developed a coarse-grain parallelization of the Buchberger algorithm for computing Grobner bases in algebras of linear differential operators. The implementation of this algorithm provides good speedups on the majority of examples coming from these noncommutative algebras, which are superior to the speedups achieved for (commutative) polynomial rings.