Parallel computation of Grobner bases on distributed memory machines

Hiroyuki Sawada, Satoshi Terasaki, Akira Aiba

Research output: Contribution to journalArticlepeer-review


When computing Grobner bases, the efficiency of computation is dominated by the total number of S-polynomials. To decrease the total number of S-polynomials, it is necessary to apply a selection strategy that selects the minimum polynomial as a new element of an intermediate base. A manager worker model is considered. To implement the selection strategy in this parallel model, synchronization between worker processes is required for every selection of a new element of the intermediate base. However, in spite of synchronization, introducing the selection strategy produces not only a better absolute computations speed but also better speedup with multi processors. About 8 times speedup with 64 processors for large problems, T-6 and Ex-17 have been achieved.

Original languageEnglish
Pages (from-to)201-216
Number of pages16
JournalKikai Gijutsu Kenkyusho Shoho/Journal of Mechanical Engineering Laboratory
Issue number5
Publication statusPublished - 1995 Sept 1
Externally publishedYes

ASJC Scopus subject areas

  • Mechanical Engineering


Dive into the research topics of 'Parallel computation of Grobner bases on distributed memory machines'. Together they form a unique fingerprint.

Cite this