Parallelizing algorithms for symbolic computation using MAPLE
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Maple on a massively parallel, distributed memory machine
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
FOXBOX: a system for manipulating symbolic objects in black box representation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Analyzing algebraic curves by cluster computing
Distributed and parallel systems
CASA - A System for Computer Aided Constructive Algebraic Geometry
DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
| Hi-index | 0.00 |
We analyze two implementation variants of a parallel computer algebra algorithm in Distributed Maple. The original solution uses a manager-worker mechanism to control task scheduling, which requires an elaborate administration scheme. The new algorithm is based on a dataflow approach where all tasks are immediately started, automatically scheduled by the runtime system, and implicitly synchronized by task dependencies; non-determinism is effectively applied to provide more potential for parallelism. It turns out that the new version is not only more declarative (closer to the mathematical problem description) but also more efficient than the original solution.