Mathematics – Numerical Analysis
Scientific paper
2011-12-28
Mathematics
Numerical Analysis
18 pages, 3 figures and 15 tables
Scientific paper
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.
Bai Fengshan
Huo Yan
Liang Heng
Wang Lei
No associations
LandOfFree
A load balancing strategy for parallel computation of sparse permanents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A load balancing strategy for parallel computation of sparse permanents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A load balancing strategy for parallel computation of sparse permanents will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32212