DocumentCode
3352325
Title
On parallel computation of grobner bases
Author
Leykin, A.
Author_Institution
University of Illinois at Chicago
fYear
2004
fDate
18-18 Aug. 2004
Firstpage
160
Lastpage
164
Abstract
We have developed a coarse-grain parallelization of the Buchberger algorithm for computing Grobner bases in algebras of linear differential operators. The implementation of this algorithm provides good speedups on the majority of examples coming from these noncommutative algebras, which are superior to the speedups achieved for (commutative) polynomial rings.
Keywords
Algebra; Concurrent computing; Conferences; Costs; Displays; Modules (abstract algebra); Parallel processing; Polynomials; Sections;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Workshops, 2004. ICPP 2004 Workshops. Proceedings. 2004 International Conference on
Conference_Location
Montreal, QC, Canada
ISSN
1530-2016
Print_ISBN
0-7695-2198-3
Type
conf
DOI
10.1109/ICPPW.2004.1328011
Filename
1328011
Link To Document