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: Plot the size of open list #35

Closed jinnaiyuu closed 9 years ago

jinnaiyuu commented 9 years ago

If there were a unbalance in each thread, there would be an unevenness in the size of the open list.

jinnaiyuu commented 9 years ago
  1. Trace the size of the open list
  2. Or just get the size in termination. It would be enough.
jinnaiyuu commented 9 years ago

Implementing a function getSize() for the open list. Might be a big function to implement.

jinnaiyuu commented 9 years ago

Implemented getsize() method for open list.

Seems there IS a positive relationship between the size of the open list and the order of the node expansion.

jinnaiyuu commented 9 years ago

Is the open list constantly unbalanced toward the "slowest" thread?

If true, outsourcing would make things better. Also there are a chance for the improvement in hash function.

This issue is related to the hash function tightly.

jinnaiyuu commented 9 years ago

Implemented the trace of the size of open lists. hdastar_random tiny_instances 1threads 32gbmem osdiff1000000 abstraction10000000 1127213112 o2461-1 order 1 2

Looks awesome. Seems there are some inequality in the number of nodes.