arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.3487cs.DCcs.AImath.CO
收藏

一种跨非连接异构基础设施的大规模分布式AI搜索框架

A framework for large-scale distributed AI search across disconnected heterogeneous infrastructures

University of St Andrews(圣安德鲁斯大学)

Lars Kotthoff, Tom Kelsey, Martin McCaffery

摘要:

我们提出了一个大规模分布式eScience人工智能搜索的框架。我们的方法是通用的,可以用于许多不同的问题。与许多其他方法不同,我们不需要专用机器,同构基础设施或节点之间通信的能力。我们特别考虑了框架的鲁棒性,即使在基础设施完全丧失后,也能最大限度地减少工作量的损失,并允许轻松验证分发过程的每一步。与大多数eScience应用程序相比,问题的输入数据和规范非常小,很容易在一段文字中给出。我们的框架解决的独特挑战与包含可能解决方案的空间的组合爆炸和长期运行计算的鲁棒性有关。不仅完成计算所需的时间是未知的,而且资源需求也可能在计算过程中发生变化。我们证明了我们的框架的适用性,用它来解决一个具有挑战性的,迄今为止在计算数学的开放问题。结果表明,我们的方法很容易扩展到十年前在实践中无法解决的计算规模。

英文摘要:

We present a framework for a large-scale distributed eScience Artificial Intelligence search. Our approach is generic and can be used for many different problems. Unlike many other approaches, we do not require dedicated machines, homogeneous infrastructure or the ability to communicate between nodes. We give special consideration to the robustness of the framework, minimising the loss of effort even after total loss of infrastructure, and allowing easy verification of every step of the distribution process. In contrast to most eScience applications, the input data and specification of the problem is very small, being easily given in a paragraph of text. The unique challenges our framework tackles are related to the combinatorial explosion of the space that contains the possible solutions and the robustness of long-running computations. Not only is the time required to finish the computations unknown, but also the resource requirements may change during the course of the computation. We demonstrate the applicability of our framework by using it to solve a challenging and hitherto open problem in computational mathematics. The results demonstrate that our approach easily scales to computations of a size that would have been impossible to tackle in practice just a decade ago.

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

↑