Extended parallelism in the Gröbner basis algorithm (Q685087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extended parallelism in the Gröbner basis algorithm |
scientific article; zbMATH DE number 417057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extended parallelism in the Gröbner basis algorithm |
scientific article; zbMATH DE number 417057 |
Statements
Extended parallelism in the Gröbner basis algorithm (English)
0 references
30 September 1993
0 references
The author presents an implementation of the Buchberger algorithm to compute Gröbner bases of an ideal in the polynomial ring utilizing two different forms of parallelism. A course-grain technique which expands and reduces \(S\)-polynomials in parallel and a fine-grain technique which uses reduction pipelines. An analysis of the implementation and a comparison to other parallel implementations is given.
0 references
shared memory multiprocessors
0 references
Buchberger algorithm
0 references
Gröbner bases
0 references
parallelism
0 references
0 references
0.8885074853897095
0 references
0.8885074853897095
0 references
0.8848891258239746
0 references
0.8596788048744202
0 references
