Computer algebra: symbolic and algebraic computation (2nd ed.)
Some examples for solving systems of algebraic equations by calculating groebner bases
Journal of Symbolic Computation
Concurrent prolog: collected papers
Concurrent prolog: collected papers
Progress report on a system for general-purpose parallel symbolic algebraic computation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Strand: new concepts in parallel programming
Strand: new concepts in parallel programming
The design of maple: A compact, portable and powerful computer algebra system
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A User-Level Interface for Clustering Mathematical Software Kernels
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Manager-Worker Parallelism versus Dataflow in a Distributed Computer Algebra System
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Solving Initial Value Problems with Parallel Maple Processes
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
PVMaple: A Distributed Approach to Cooperative Work of Maple Processes
Proceedings of the 7th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Distributed maple: parallel computer algebra in networked environments
Journal of Symbolic Computation
Improving your cash flow: the computer algebra shell
IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
| Hi-index | 0.00 |
||MAPLE|| (speak: parallel Maple) is a portable system for parallel symbolic computation. The system is built as an interface between the parallel declarative programming language Strand and the sequential computer algebra system Maple, thus providing the elegance of Strand and the power of the existing sequential algorithms in Maple.The implementation of different parallel programming paradigms shows that it is fairly easy to parallelize even complex algebraic algorithms using this system. Sample applications (among them algorithms solving multivariate nonlinear equation systems) are implemented on various parallel architectures. For example a straightforward parallelization of the complex and important problem of real root isolation has been parallelized using a generic Strand program of fewer than 20 lines of code and a slight modification of 5 lines in the original sequential Maple source. Even with such a simple modification we gained a speed-up of 5 times, that is better than those reported by others in the literature.