Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Evaluation of Baseline Methods for IDD-based SSD External Memory Search

About

Many difficult search problems cannot be solved by algorithms such as A* using only RAM. Search algorithms which use external memory such as SSDs and HDDs with much higher capacity than RAM have been proposed in previous work, but previous work has focused on delayed duplicate detection approaches, as well as complex immediate duplicate detection (IDD) methods, and relatively simple methods for IDD have not been systematically studied. In addition, the effect of OS-level mechanisms for managing and speeding up accesses to external memory, such as page caches, has not been studied. This paper addresses these gaps in the literature by evaluating and analyzing the performance of simple baseline approaches for IDD-based A*.

Yuki Suzuki, Alex Fukunaga• 2026

Related benchmarks

TaskDatasetResultRank
Automated PlanningPlanning Problems 1.0GiB RAM limit
Expansion Rate (states/sec)1.58e+5
96
Heuristic SearchMerge-and-shrink heuristic benchmark set
Expansion Rate (states/sec)1.82e+5
88
Heuristic SearchBlind heuristic benchmark set
Expansions/sec7.70e+4
64
Automated PlanningPlanning Problems 600MiB RAM limit
Expansion Rate (states/sec)7.22e+4
32
Heuristic Planningblocksworld p23
Expansion Rate (states/sec)6.19e+5
3
Heuristic Planningdata-network p08
Expansion Rate (states/sec)1.28e+5
3
Heuristic Planningdepots p23
Expansion Rate (states/sec)2.26e+5
3
Heuristic Planningfloortile p03
Expansion Rate (states/sec)3.86e+5
3
Heuristic Planningmprime p05
Expansion Rate (states/sec)2.36e+5
3
Heuristic Planningrovers-p03
Expansion Rate (states/sec)2.29e+5
3
Showing 10 of 12 rows

Other info

Follow for update