zbMATH — the first resource for mathematics

Manager-worker parallelism versus dataflow in a distributed computer algebra system. (English) Zbl 0997.68674
Malyshkin, Victor (ed.), Parallel computing technologies. 6th international conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2127, 329-343 (2001).
Summary: 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.
For the entire collection see [Zbl 0969.00083].
Reviewer: Reviewer (Berlin)

68U99 Computing methodologies and applications
68M14 Distributed systems
68W30 Symbolic computation and algebraic computation
Full Text: Link