arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.03254cs.AIcs.DC
收藏

基于Hash的并行最佳优先搜索工作分配方法研究

On Hash-Based Work Distribution Methods for Parallel Best-First Search

The University of Tokyo(东京大学)

Yuu Jinnai, Alex Fukunaga

摘要:

并行最佳优先搜索算法(如散列分布式A*(HDA*))使用全局散列函数在进程之间分配工作。我们分析了最先进的基于哈希的并行最佳优先搜索算法的搜索和通信开销,并表明,虽然Zobrist哈希,HDA* 使用的标准哈希函数,实现了良好的负载平衡,为许多域,它会产生显着的通信开销,因为几乎所有生成的节点被转移到不同的处理器比他们的父母。我们提出了抽象Zobrist哈希,一种新的工作分配方法并行搜索,而不是计算一个哈希值的基础上的原始功能的状态,使用一个功能投影函数生成一组抽象的功能,从而导致在一个更高的本地化,从而减少通信开销。我们表明,抽象Zobrist散列优于以前的方法搜索域使用手工编码,域特定的特征投影函数。然后,我们提出GRAZHDA*,一个基于图分区的方法来自动生成特征投影函数。GRAZHDA* 试图通过划分域转换图(状态空间图的抽象)来近似实际搜索空间图的划分。我们表明,GRAZHDA* 优于以前的方法域独立的规划。

英文摘要:

Parallel best-first search algorithms such as Hash Distributed A* (HDA*) distribute work among the processes using a global hash function. We analyze the search and communication overheads of state-of-the-art hash-based parallel best-first search algorithms, and show that although Zobrist hashing, the standard hash function used by HDA*, achieves good load balance for many domains, it incurs significant communication overhead since almost all generated nodes are transferred to a different processor than their parents. We propose Abstract Zobrist hashing, a new work distribution method for parallel search which, instead of computing a hash value based on the raw features of a state, uses a feature projection function to generate a set of abstract features which results in a higher locality, resulting in reduced communications overhead. We show that Abstract Zobrist hashing outperforms previous methods on search domains using hand-coded, domain specific feature projection functions. We then propose GRAZHDA*, a graph-partitioning based approach to automatically generating feature projection functions. GRAZHDA* seeks to approximate the partitioning of the actual search space graph by partitioning the domain transition graph, an abstraction of the state space graph. We show that GRAZHDA* outperforms previous methods on domain-independent planning.

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

↑