🚀 go-pugleaf

In article <C0HwLH.I0I@usenet.ucs.indiana.edu>, dhart@bronze.ucs.indiana.edu (Dave Hart) writes:
> 	I seem to recall something about a parallel version of Maple,
> a few monthes ago... and can't find it now.  Any pointers would be
> greatly appreciated.
> 

I'm the one who developed a parallel version of Maple (||MAPLE||).
For all who are interrested in that work, here is the posting by myself from November
again.

||MAPLE|| is a portable Computer Algebra system in which logic programming provides
parallelism and imperative programming provides efficiency. The system is
built as a combination between the parallel declarative programming language
Strand and the sequential computer algebra system Maple.

Programming in that system is done in two layers.
The top (parallel, declarative) layer is Strand from where one may call Maple functions
to perform the time critical sequential parts. Due to that design ||MAPLE|| programs
are binary compatible among every hardware and independend of the number of processors.

There are also predefined generic parallel functions available, that alow nearly automatic
parallelization of algorithms used in Computer Algebra. Maple's Real Root isolation proc.
for example has been parallelized by changing 5 lines in the source using that feature.

A parallelized user interface alows subsequently entering querys without waiting for
the availability of the previous result. Data dependencies are automaticaly
resolved by the system.

||MAPLE|| currently runs on Sequent shared memory machines, Transputer distributive
memory machines and on Networks of SUN Workstations.

Feel free to contact siegl@risc.uni-linz.ac.at for further information.

Kurt

----------------------------------------------------------
You can tell how far we have to go, when FORTRAN is the language of
supercomputers.    -- Steven Feiner
----------------------------------------------------------
Kurt Siegl / RISC, University of Linz, Austria
email: siegl@risc.uni-linz.ac.at
Tel:   *(7236)3231-66      Fax: *(7236)3231-30