Oliver Gloor

Learn More
We investigate sources of parallelism in the Grobner Basis algorithm for their practical use on the desk-top. Our execution environment is a standard multi-processor workstation, and our parallel programming environment is PARSAC-2 on top of a multi-t breaded operating system. We invest igate the performance of two main variants of our master parallel(More)
The Grr obner Walk is a basis conversion method proposed by Collart, Kalkbrener, and Mall. It converts a given Grr obner basis G of a (possibly positive dimensional) polynomial ideal I to a Grr obner basis G 0 of I with respect to another term order. The target Grr obner basis is approached in several steps (the Walk), each performing a simpler Grr obner(More)
The Grr obner Walk is an algorithm which converts a given Grr obner basis of a polynomial ideal I of arbitrary dimension to a Grr obner basis of I with respect to another term order. The conversion is done in several steps (the walk) following a path in the Grr obner fan of I. We report on our experiences with a rst implementation of the walk connected with(More)
The Grr obner Walk is an algorithm that converts a given Grr obner basis of a polynomial ideal I of arbitrary dimension to a Grr obner basis of I with respect to another term order. The conversion is done in several steps (the walk) following a path in the Grr obner fan of I. We report on our experiences with an implementation of the walk. We discuss(More)
  • 1