A load balancing strategy for parallel computation of sparse permanents

The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find that the time spending for computing the permanent of a sparse matrix by hybrid algorithm is strongly correlated to its permanent value. A strategy is introduced to improve a parallel algorithm for sparse permanent. Methods for approximating permanents, which have been studied extensively, are used to approximate the permanent values of sub-matrices to decide the processing order of jobs. This gives an improved load balancing method. Numerical results show that the parallel efficiency is improved remarkably for the permanents of fullerene graphs, which are of great interests in nanoscience.

[1]  H. E. Slaught.  THE CARUS MATHEMATICAL MONOGRAPHS , 1923 .

[2]  Dominik Marx,et al.  Calculation of the permanent of a sparse positive matrix , 2003 .

[3]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[4]  Ernesto Estrada,et al.  Chemical Graph Theory , 2013 .

[5]  R. Forthofer,et al.  Rank Correlation Methods , 1981 .

[6]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[7]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[8]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[9]  Fengshan Bai,et al.  A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes , 2004, Comput. Phys. Commun..

[10]  Ralph Kallman,et al.  A method for finding permanents of 0,1 matrices , 1982 .

[11]  Gordon G. Cash,et al.  The permanent of 0,1 matrices and Kallman's algorithm , 2000 .

[12]  Richard J. Lipton,et al.  A Monte-Carlo Algorithm for Estimating the Permanent , 1993, SIAM J. Comput..

[13]  Michael Luby,et al.  Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..

[14]  Fengshan Bai,et al.  A hybrid algorithm for computing permanents of sparse matrices , 2006, Appl. Math. Comput..

[15]  R. H. Myers.  Classical and modern regression with applications , 1986 .

[16]  Heng Liang,et al.  Computing the Permanental Polynomial of C60 in Parallel , 2008 .

[17]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[18]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[19]  Mark Jerrum.  An analysis of a Monte Carlo algorithm for estimating the permanent , 1993, IPCO.

[20]  Fengshan Bai,et al.  An efficient algorithm for computing permanental polynomials of graphs , 2006, Comput. Phys. Commun..

[21]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[22]  Steve Chien,et al.  Clifford algebras and approximating the permanent , 2002, STOC '02.