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

一种简单、可扩展、并行的最佳优先搜索策略的评估

Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy

Tokyo Institute of Technology(东京工业大学);The University of Tokyo(东京大学);NICTA(澳大利亚国家信息与通信技术研究院);The Australian National University(澳大利亚国立大学);IBM Research(IBM研究院)

Akihiro Kishimoto, Alex Fukunaga, Adi Botea

摘要:

由商用处理器组成的大规模并行集群越来越多,使得能够使用巨大的处理能力和分布式RAM来解决硬搜索问题。我们调查散列分布式A*(HDA*),一个简单的方法来并行最佳优先搜索,异步分配和调度处理器之间的工作的基础上的哈希函数的搜索状态。我们使用这种方法来并行化的A* 算法在一个最佳的顺序版本的快速向下规划,以及24难题求解器。HDA* 的扩展行为在共享内存、8核多核机器、使用多达64核的商用机器集群以及使用多达2400个处理器的大规模高性能集群上进行了实验评估。我们表明,这种方法的规模很好,允许有效利用大量的分布式内存,以最佳的解决问题,需要太字节的RAM。我们还比较了HDA* 和转换表驱动调度(TDS),这是IDA* 的一种基于散列的并行化,并表明,在规划方面,HDA* 明显优于TDS。一个简单的混合,结合HDA* 和TDS利用这两种算法的优势,提出和评估。

英文摘要:

Large-scale, parallel clusters composed of commodity processors are increasingly available, enabling the use of vast processing capabilities and distributed RAM to solve hard search problems. We investigate Hash-Distributed A* (HDA*), a simple approach to parallel best-first search that asynchronously distributes and schedules work among processors based on a hash function of the search state. We use this approach to parallelize the A* algorithm in an optimal sequential version of the Fast Downward planner, as well as a 24-puzzle solver. The scaling behavior of HDA* is evaluated experimentally on a shared memory, multicore machine with 8 cores, a cluster of commodity machines using up to 64 cores, and large-scale high-performance clusters, using up to 2400 processors. We show that this approach scales well, allowing the effective utilization of large amounts of distributed memory to optimally solve problems which require terabytes of RAM. We also compare HDA* to Transposition-table Driven Scheduling (TDS), a hash-based parallelization of IDA*, and show that, in planning, HDA* significantly outperforms TDS. A simple hybrid which combines HDA* and TDS to exploit strengths of both algorithms is proposed and evaluated.

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

↑