Parallel computation of Grobner bases on distributed memory machines

Hiroyuki Sawada, Satoshi Terasaki, Akira Aiba

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)201-216
ページ数16
ジャーナルKikai Gijutsu Kenkyusho Shoho/Journal of Mechanical Engineering Laboratory
49
5
出版ステータスPublished - 1995 9 1
外部発表はい

ASJC Scopus subject areas

  • 機械工学

フィンガープリント

「Parallel computation of Grobner bases on distributed memory machines」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル