Go backward to Distributed Maple Go up to Top Go forward to Conclusions |
As discussed in Section *, one of the most time-consuming
components of the CASA function pacPlot
is the computation of
multi-variate polynomial resultants. In this section, we are going to describe
the problem, a sequential solution algorithm, a parallel version of this
algorithm, and our implementation of this algorithm in Distributed Maple. We
conclude by listing benchmark results that demonstrate the actual efficiency
of the parallel solution.