Extended parallelism in the Groebner basis algorithm
Journal Article
·
· International Journal of Parallel Programming; (United States)
- Carnegie Mellon Univ., Pittsburgh, PA (United States)
This paper presents a new parallel implementation to compute Groebner bases utilizing two different forms of parallelism. A course-grain technique developed by Hean-Phillipe Vidal expands and reduces S-polynomials in parallel. A fine-grain technique, proposed by Melenk and Neun, constructs a pipeline of processors to overlap execution of the reduction operations. A hybrid algorithm that outperforms both of the original approaches is presented. The combined algorithm requires the user to select the appropriate allocation of processors to the two styles of parallelism, and uses this static assignment throughout the computation. The paper also discusses the design and implementation approaches used to construct an efficient version of this algorithm.
- OSTI ID:
- 7240758
- Journal Information:
- International Journal of Parallel Programming; (United States), Journal Name: International Journal of Parallel Programming; (United States) Vol. 21:1; ISSN IJPPE5; ISSN 0885-7458
- Country of Publication:
- United States
- Language:
- English
Similar Records
A highly parallel algorithm for root extraction
Pipelined data-parallel algorithms. Part 1; Concept and modeling
Pipelined data parallel algorithms: Concept and modeling
Journal Article
·
Tue Feb 28 23:00:00 EST 1989
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6275865
Pipelined data-parallel algorithms. Part 1; Concept and modeling
Journal Article
·
Mon Oct 01 00:00:00 EDT 1990
· IEEE Transactions on Parallel and Distributed Systems; (USA)
·
OSTI ID:6356451
Pipelined data parallel algorithms: Concept and modeling
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6852902