Parallel computation of Grobner bases on distributed memory machines

Hiroyuki Sawada, Satoshi Terasaki, Akira Aiba

Research output: Contribution to journalArticle

Abstract

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
Volume49
Issue number5
Publication statusPublished - 1995 Sep
Externally publishedYes

Fingerprint

Polynomials
Data storage equipment
Synchronization
Managers

ASJC Scopus subject areas

  • Mechanical Engineering

Cite this

Parallel computation of Grobner bases on distributed memory machines. / Sawada, Hiroyuki; Terasaki, Satoshi; Aiba, Akira.

In: Kikai Gijutsu Kenkyusho Shoho/Journal of Mechanical Engineering Laboratory, Vol. 49, No. 5, 09.1995, p. 201-216.

Research output: Contribution to journalArticle

@article{4f6cf7f6ed734c35a33ac942a3e7b2c7,
title = "Parallel computation of Grobner bases on distributed memory machines",
abstract = "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.",
author = "Hiroyuki Sawada and Satoshi Terasaki and Akira Aiba",
year = "1995",
month = "9",
language = "English",
volume = "49",
pages = "201--216",
journal = "Kikai Gijutsu Kenkyusho Shoho/Journal of Mechanical Engineering Laboratory",
issn = "0388-4252",
publisher = "Agency of Industrial Science and Technology",
number = "5",

}

TY - JOUR

T1 - Parallel computation of Grobner bases on distributed memory machines

AU - Sawada, Hiroyuki

AU - Terasaki, Satoshi

AU - Aiba, Akira

PY - 1995/9

Y1 - 1995/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029371470&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029371470&partnerID=8YFLogxK

M3 - Article

VL - 49

SP - 201

EP - 216

JO - Kikai Gijutsu Kenkyusho Shoho/Journal of Mechanical Engineering Laboratory

JF - Kikai Gijutsu Kenkyusho Shoho/Journal of Mechanical Engineering Laboratory

SN - 0388-4252

IS - 5

ER -