Progress Report on Parallelism in MuPAD

MuPAD is a general purpose computer algebra system with two programming concepts for parallel processing: {\em micro-parallelism\/} for shared-memory machines and {\em macro-parallelism\/} for distributed architectures. This article describes language instructions for both concepts, the current state of implementation, together with some examples.

[1]  Hirokazu Murao,et al.  Modular Algorithm for Sparse Multivariate Polynomial Interpolation and its Parallel Implementation , 1996, J. Symb. Comput..

[2]  Karsten Morisse,et al.  MuPAD User’s Manual , 1996 .

[3]  Joel F. Bartlett,et al.  Mostly-Copying Garbage Collection Picks Up Generations and C++ , 1999 .

[4]  Christian Heckler,et al.  Parallelism in MuPAD , 1997, SIGS.

[5]  Joel F. Bartlett,et al.  Compacting garbage collection with ambiguous roots , 1988, LIPO.

[6]  Paul S. Wang,et al.  Design and Implementation of MP, a Protocol for Efficient Exchange of Mathematical Expressions , 1998, J. Symb. Comput..

[7]  Jack Dongarra,et al.  PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[8]  Giuseppe Attardi,et al.  Strategy-Accurate Parallel Buchberger Algorithms , 1996, J. Symb. Comput..

[9]  Giuseppe Attardi,et al.  Customising Object Allocation , 1994, ECOOP.

[10]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[11]  Hans Schönemann,et al.  MPP: a framework for distributed polynomial computations , 1996, ISSAC '96.

[12]  Paul S. Wang,et al.  Parallel Polynomial Operations on SMPs: an Overview , 1996, J. Symb. Comput..

[13]  Holger Naundorf.  Ein denotationales Modell für parallele objektbasierte Systeme , 1997 .

[14]  Victor Shoup,et al.  A New Polynomial Factorization Algorithm and its Implementation , 1995, J. Symb. Comput..

[15]  Robert Grossman.  1st International IMACS Conference on Applications of Computer Algebra , 1995, SIGS.