Component-level parallelization of triangular decompositions
Marc Moreno Maza, Yuzhen Xie · 2007
We discuss the parallelization of algorithms for solving poly-nomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which the number of processors in use depends on the geometry of the solution set of the input system. Our long term goal is to achieve an efficient multi-level parallelism: coarse grained (component) level for tasks computing geometric objects in the solution sets, and medium/fine grained level for polynomial arithmetic such as GCD/resultant computation within each task.