Parallel Polynomial Operations in the Buchberger Algorithm.
Please always quote using this URN: urn:nbn:de:0297-zib-125
- The Buchberger algorithm is a basic tool for the solution of systems of polynomial equations in an environment of computer algebra applications. A model for overlapped processing of different steps of the algorithm is presented, which uses the data structure of the polynomials (distributive representation) for synchronization. The model can be applied for multi processors with fast access to shared data. It is tested with Cray X-MP multi processors based on a parallel version of Portable Standard Lisp (PSL 3.4).
| Author: | Herbert Melenk, Winfried Neun |
|---|---|
| Document Type: | ZIB-Report |
| Date of first Publication: | 1988/03/15 |
| Series (Serial Number): | ZIB-Report (SC-88-04) |
| ZIB-Reportnumber: | SC-88-04 |
| Published in: | Appeared in: Computer Algebra and Parallelism, J. D. Dora, J. Fitch (eds.) Academic Press 1989 |
