Parallel breadth-first heuristic search on a shared-memory architecture

AAAI Workshop - Technical Report

Volumn WS-06-08, Issue , 2006, Pages 33-38

  Yang, Zhang ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BREADTH-FIRST SEARCH GRAPH; DYNAMIC LOAD BALANCING; HEURISTIC SEARCH; SHARED-MEMORY ARCHITECTURE;

COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DYNAMIC LOADS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; SEARCH ENGINES;

HEURISTIC METHODS;

EID: 33846017346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Barnat, J.; Brim, L.; and Chaloupka, J. 2003. Parallel breadth-first search LTL model-checking. In Proceedings of the 18th IEEE International Conference on Automated Software Engineering (ASE ' 03), 106-115.
2. Berger, E. D.; McKinley, K. S.; Blumofe, R. D.; and Wilson, P. R. 2000. Hoard: A scalable memory al-locator for multithreaded applications. In The Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX). Cambridge, Massachusetts.
3. Berger, E. D. 2006. The hoard allocator website. http://www.hoard.org/. Accessed March 19, 2006.
4. Brim, L.; Černá, I.; Krčál, P.; and Pelák, R. 2001. Distributed LTL model checking based on negative cycle detectioin. In Lecture Notes in Computer Science, volume 2245, 6-107.
5. Grama, A., and Kumar, V. 1999. State of the art in parallel search techniques for discrete optimization problems. IEEE Transactions on Knowledge and Data Engineering 11(1).
6. Grama, A.; Gupta, A.; Karypis, G.; and Kumar, V. 2003. Introduction to Parallel Computing: Second Edition. Addison-Wesley. ISBN 0-201-64865-2.
7. Heyman, T. Geist, D.; Grumberg, O.; and Schuster, A. 2002. A scalable parallel algorithm for reachability analysis of very large circuits. Formal Methods in Systems Design 21:317-338.
8. Korf, R., and Schultze, P. 2005. Large-scale parallel breadth-first search. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), 1380-1385.
9. Korf, R.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. Journal of the ACM 52(5):715-748.
10. Korf, R. 1985. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27:97-109.
11. Kumar, V., and Rao, V. N. 1987. Parallel depth-first search on multiprocessors part II: Analysis. International Journal of Parallel Programming 16(6): 501-519.
12. Kumar, V.; Ramesh, K.; and Rao, V. N. 1988. Parallel best-first search of state-space graphs: A summary of results. In Proceedings of the 1988 National Conference on Artificial Intelligence (AAAI-88).
13. Lamborn, P., and Hansen, E. 2006. Memory-efficient graph search in planning and model checking. In Proceedings of the Doctoral Consortium of the 16th International Conference on Automated Planning and Scheduling (ICAPS-06).
14. Lea, D. 2006. The Java concurrency package. Online at http://gee.cs.oswego.edu/dl/concurrencyinterest/index.html. Accessed March 19, 2006.
15. Lerda, F., and Sisto, R. 1999. Distributed-memory model checking with SPIN. In Proceedings of the 6th International SPIN Workshop.
16. Rao, V. N., and Kumar, V. 1987. Parallel depth-first search on multiprocessors part I: Implementation. International Journal of Parallel Programming 16(6):479-499.
17. Yoo, A.; Chow, E.; Henderson, K.; and McLendon, W. 2005. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In Proceedings of the ACM/IEEE Supercomputing 2005 Conference, 25-35.
18. Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170:385-408.