arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1112.6072math.NAcs.NAmath.COphysics.chem-ph
收藏

稀疏永久并行计算中的负载均衡策略

A load balancing strategy for parallel computation of sparse permanents

Tsinghua University(清华大学);China Citic Bank(中信银行)

Lei Wang, Heng Liang, Fengshan Bai, Yan Huo

AI总结:

针对稀疏矩阵永久计算的并行算法,提出利用永久近似值排序子任务以改进负载均衡,显著提高富勒烯图永久计算的并行效率。

摘要:

组合优化中的并行机器调度研究表明,当作业按处理时间非递增顺序排序时,可实现理想的并行效率。本文发现,通过混合算法计算稀疏矩阵的永久所花费的时间与其永久值密切相关。引入了一种策略来改进稀疏永久的并行算法。利用已被广泛研究的永久近似方法,估计子矩阵的永久值以决定作业的处理顺序。这提供了一种改进的负载均衡方法。数值结果表明,对于纳米科学中具有重要意义的富勒烯图,其永久的并行效率得到了显著提高。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑