Parallel state space search on the GPU

International Symposium on Combinatorial Search, SoCS 2009

Volumn , Issue , 2009, Pages

  Edelkamp, Stefan ^a   Sulewski, Damian ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-VECTOR REPRESENTATION; BREADTH-FIRST SEARCH; CORE COMPUTATION; GPU ALGORITHMS; GRAPHICS CARD; GRAPHICS PROCESSING UNITS; SPEED UP; STATE SPACE SEARCH;

COMPUTER GRAPHICS; HASH FUNCTIONS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS;

COMPUTER GRAPHICS EQUIPMENT;

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

References (19)

1. Bonet, B. 2008. Efficient algorithms to rank and unrank permutations in lexicographic order. In AAAI-Workshop on Search in AI and Robotics.
2. Botelho, F. C., and Ziviani, N. 2007. External perfect hashing for very large key sets. In CIKM, 653-662.
3. Chen, T., and Skiena, S. 1996. Sorting with fixed-length reversals. Discrete Applied Mathematics 71(1-3):269-295.
4. Cooperman, G., and Finkelstein, L. 1992. New methods for using Cayley graphs in interconnection networks. Discrete Applied Mathematics 37/38:95-118.
5. Dweighter, M. 1975. Problem e2569. American Mathematical Monthly (82):1010.
6. Edelkamp, S., and Jabbar, S. 2006. Large-scale directed model checking LTL. In SPIN, 1-18.
7. Gates, W. H., and Papadimitriou, C. H. 1979. Bounds for sorting by prefix reversal. Discrete Mathematics 27:47-57.
8. Hordern, E. 1986. Sliding Piece Puzzles. Oxford University Press.
9. Korf, R. E., and Schultze, T. 2005. Large-scale parallel breadth-first search. In AAAI, 1380-1385.
10. Korf, R. E. 1997. Finding optimal solutions to Rubik's Cube using pattern databases. In AAAI, 700-705.
11. Korf, R. E. 2003. Breadth-first frontier search with delayed duplicate detection. In MoChArT), 87-92.
12. Korf, R. E. 2008. Minimizing disk I/O in two-bit-breathfirst search. In AAAI, 317-324.
13. Kunkle, D., and Cooperman, G. 2007. Twenty-six moves suffice for Rubik's cube. In ISSAC, 235 - 242.
14. Munagala, K., and Ranade, A. 1999. I/O-complexity of graph algorithms. In SODA, 687-694.
15. Myrvold,W., and Ruskey, F. 2001. Ranking and unranking permutations in linear time. Information Processing Letters 79(6):281-284.
16. Owens, J. D.; Houston, M.; Luebke, D.; Green, S.; Stone, J. E.; and Phillips, J. C. 2008. GPU computing. Proceedings of the IEEE 96(5):879-899.
17. Zhou, R., and Hansen, E. A. 2004. Structured duplicate detection in external-memory graph search. In AAAI, 683- 689.
18. Zhou, R., and Hansen, E. A. 2006. Breadth-first heuristic search. AI 170(4-5):385-408.
19. Zhou, R., and Hansen, E. A. 2007. Parallel structured duplicate detection. In AAAI, 1217-1222.