=ADD=
=reftype=
14
=number=
00-34
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-34.ps.gz
=year=
2000
=month=
12
=author=
Schreiner; Wolfgang
=title=
Manager-Worker Parallelism versus Dataflow in Distributed Maple
=abstract=
  We analyze two implementation variants of a parallel computer algebra
  algorithm in Distributed Maple. The original (previously published) solution
  uses a manager-worker mechanism to control task scheduling, which requires
  an elaborate administration scheme.  The new algorithm is based 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.
=note=
=howpublished=
=sponsor=
Austrian Science Foundation (FWF) grant SFB F013/F1304
=keywords=
parallel computing, computer algebra, algebraic geometry, declarative programming, task scheduling.