Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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
The categories of this paper are: cs
14
The categories of this paper are: math-ph
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
22
The categories of this paper are: chao-dyn
34
The categories of this paper are: chem-ph
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an