A parallelization of the Buchberger algorithm

Authors:
R. Bradford
Affiliations:
School of Mathematical Sciences, University of Bath, Bath BA2 7AY, UK
Venue:
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1990

Citing 3
Cited 1

Linda in context

Communications of the ACM
The computation of Gröbner bases on a shared memory multiprocessor

DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Evaluation of "performance enhancements" in algebraic manipulation systems

Evaluation of "performance enhancements" in algebraic manipulation systems

Component-level parallelization of triangular decompositions

Proceedings of the 2007 international workshop on Parallel symbolic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have experimented with a little elementary parallelism applied to Buchberger's algorithm. This is in contrast to [Ponder] and [Vidal], as gains can be achieved by using the method even on a single processor.