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

06/10/2017
by   Yuu Jinnai, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2023

Fast Consistent Hashing in Constant Time

Consistent hashing is a technique that can minimize key remapping when t...
research
06/18/2012

Compact Hyperplane Hashing with Bilinear Functions

Hyperplane hashing aims at rapidly searching nearest points to a hyperpl...
research
10/21/2019

Hadamard Codebook Based Deep Hashing

As an approximate nearest neighbor search technique, hashing has been wi...
research
01/05/2015

Hashing with binary autoencoders

An attractive approach for fast search in image databases is binary hash...
research
03/01/2019

Optimal Projection Guided Transfer Hashing for Image Retrieval

Recently, learning to hash has been widely studied for image retrieval t...
research
02/10/2023

Unified Functional Hashing in Automatic Machine Learning

The field of Automatic Machine Learning (AutoML) has recently attained i...
research
02/16/2020

Directed Graph Hashing

This paper presents an algorithm for structurally hashing directed graph...

Please sign up or login with your details

Forgot password? Click here to reset