arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.4885cs.AI
收藏

复杂性估计中的一个实例研究:图模型上的并行分支定界

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models

University of California, Irvine(加州大学尔湾分校)

Lars Otten, Rina Dechter

摘要:

我们研究的背景下,并行化一个先进的分支和边界类型的算法在图形模型的复杂性估计的问题。该算法的剪枝能力使得负载均衡这一分布式系统的关键因素变得非常具有挑战性。我们建议使用一个统计回归模型来识别和解决复杂的并行子问题,负载不平衡的原因,提前。所提出的模型进行评估和分析,在各个层面上,并产生强大的预测。然后,我们证明了它的有效性,在实践中的负载均衡。

英文摘要:

We study the problem of complexity estimation in the context of parallelizing an advanced Branch and Bound-type algorithm over graphical models. The algorithm's pruning power makes load balancing, one crucial element of every distributed system, very challenging. We propose using a statistical regression model to identify and tackle disproportionally complex parallel subproblems, the cause of load imbalance, ahead of time. The proposed model is evaluated and analyzed on various levels and shown to yield robust predictions. We then demonstrate its effectiveness for load balancing in practice.

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

↑