search

jinnaiyuu / Hash-Distributed-Astar

Hash Distributed A*
https://sites.google.com/site/yuujinnaishomepage/home/parallel-search
MIT License
3 stars 1 forks source link

TODO: Evaluate R<, R=, R>, Rr #19

Closed jinnaiyuu closed 9 years ago

jinnaiyuu commented 10 years ago

Evaluate the search overhead in depth. R<: Nodes that should be expanded R=: Some need expansion, but the others do not. R>: Nodes that do not need expansion.

Let's compare R= relative to single thread astar seaerch as that might be the "hidden" overhead.

jinnaiyuu commented 10 years ago

Rr is duplicated nodes. In order to calculate these ratios, I have to give the goal f for the instance before it runs, so that it needn't to remember every f value but just three ways. It's also easier to parse down.

jinnaiyuu commented 10 years ago

Rr had a bug. It was only calculating the node that is duplicated and need to be expanded. Well, might be a useful information too.

jinnaiyuu commented 10 years ago

It is shown in global order plot.