Research map / Learning theory and algorithms / Combinatorial and search optimization
Abstract Zobrist Hashing: An Efficient Work Distribution Method for Parallel Best-First Search
Yuu Jinnai, Alex Fukunaga
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| hash abstract features (feature projection) instead of raw features in Zobrist hashing | HDA* · PDDL planning, 8 threads | average efficiency: 0.766 -> 0.797 | Improved |
| hash abstract features instead of raw features in Zobrist hashing | HDA* · PDDL planning, 8 threads | average communication overhead: 0.857 -> 0.620 | Improved |
| hash abstract features instead of raw features in Zobrist hashing | HDA* · PDDL planning, 8 threads | total wall-clock time (sec): 298.92 -> 282.29 | Improved |
| add Zobrist-style hashing over abstract features instead of pure abstraction-based assignment | HDA* · PDDL planning, 8 threads | average search overhead: 0.034 -> -0.006 | Improved |
| use Abstract Zobrist hashing instead of Zobrist hashing | HDA* · 15-puzzle, 24-puzzle, MSA | efficiency | Improved |
| use Abstract Zobrist hashing instead of Zobrist hashing | HDA* · 15-puzzle | search overhead | Hurt |
| use abstraction-based distribution (AHDA*) instead of Zobrist hashing | HDA* · 15-puzzle, 24-puzzle | search overhead / efficiency: roughly 2-4x higher search overhead on 24-puzzle | Hurt |
| use perfect-hashing permutation indexing (PHDA*) for work distribution | HDA* · 15-puzzle | efficiency | Hurt |
Closest papers by meaning
- Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search (AAAI 2025 · similarity 0.80)
- Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (NeurIPS 2024 · similarity 0.80)
- DualMap: Enabling Both Cache Affinity and Load Balancing for Distributed LLM Serving (ICLR 2026 · similarity 0.79)
- Parallel Empirical Evaluations: Resilience despite Concurrency (AAAI 2024 · similarity 0.79)
- GPU-Accelerated Synthesis of Mixed-Boolean Arithmetic: Beyond Caching (NeurIPS 2026 · similarity 0.79)
- Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale (NeurIPS 2026 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
