MIXED VOLUME COMPUTATION IN PARALLEL

Efficient algorithms for computing mixed volumes, via the computation of mixed cells, have been implemented in DEMiCs \cite{Mizutani1} and MixedVol-2.0 \cite{Le}. While the approaches in those two packages are somewhat different, they follow the same theme and are both highly serial. To fit the need for the parallel computing, a reformulation of the algorithms is inevitable. This article proposes a reformulation of the algorithm for the mixed volume computation rooted from algorithms in graph theory, making it much more fine-grained and scalable. The resulting parallel algorithm can be readily adapted to both distributed and shared memory computing systems. Illustrated by the numerical results on several different architectures, the speedups of our parallel algorithms for the mixed volume computation are remarkable.

[1]  Douglas Thain,et al.  Distributed computing in practice: the Condor experience , 2005, Concurr. Pract. Exp..

[2]  Jack Dongarra,et al.  MPI: The Complete Reference , 1996 .

[3]  Eecient Incremental Algorithms for the Sparse Resultant and the Mixed Volume , 1995 .

[4]  Xing Li,et al.  Finding Mixed Cells in the Mixed Volume Computation , 2001, Found. Comput. Math..

[5]  Tangan Gao,et al.  Algorithm 846: MixedVol: a software package for mixed-volume computation , 2005, TOMS.

[6]  W. Marsden.  I and J , 2012 .

[7]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[8]  Ian T. Foster,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2004, Cluster Computing.

[9]  Bernd Sturmfels,et al.  A polyhedral method for solving sparse polynomial systems , 1995 .

[10]  R. Moeckel,et al.  Finiteness of stationary configurations of the four-vortex problem , 2008 .

[11]  T. Y. Li.  Numerical solution of multivariate polynomial systems by homotopy continuation methods , 2008 .

[12]  Akiko Takeda,et al.  Dynamic Enumeration of All Mixed Cells , 2007, Discret. Comput. Geom..

[13]  I. Damgård,et al.  The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.

[14]  Tien Yien Li,et al.  Solving polynomial systems by polyhedral homotopies , 1999 .

[15]  Peter S. Pacheco.  Parallel programming with MPI , 1996 .

[16]  James Reinders,et al.  Intel threading building blocks - outfitting C++ for multi-core processor parallelism , 2007 .

[17]  Heinz Kredel,et al.  Some Examples for Solving Systems of Algebraic Equations by Calculating Groebner Bases , 1986, J. Symb. Comput..

[18]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[19]  A. Morgan.  Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems , 1987 .

[20]  Leonie Kohl,et al.  Parallel Programming In C With Mpi And Open Mp , 2016 .

[21]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[22]  V. W. Noonburg.  A neural network modeled by an adaptive Lotka-Volterra system , 1989 .

[23]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[24]  Tien-Yien Li,et al.  Mixed Volume Computation for Semi-Mixed Systems , 2003, Discret. Comput. Geom..

[25]  A. Chenciner,et al.  Le problème des n corps et les distances mutuelles , 1997 .