Advertisement

An efficient implementation of parallel A*

  • Van -Dat Cung
  • Bertrand Le Cun
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 805)

Abstract

This paper presents a new parallel implementation of the heuristic state space search A* algorithm. We show the efficiency of a new utilization of data structure the treap, instead of traditional priority queues (heaps). This data structure allows operations such as Insert, DeleteMin and Search which are essential in the A* algorithm. Furthermore, we give concurrent algorithm of the treap within a shared memory environment. Results on the 15 puzzle are presented; they have been obtained on two machines, with virtual or not shared memory, the KSR1 and the Sequent Balance 8000.

Keywords

Heuristic search A* data structure binary search tree priority queue parallelism concurrence 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho (A.), Hopcroft (J.) et Ullman (J.).-The Design and Analysis of Computer Algorithms.-Addison-Wesley, 1974.Google Scholar
  2. 2.
    Aragon (C.) et Aragon R. (G. S.).-Randomized search trees. FOCS 30, 1989, pp. 540–545.Google Scholar
  3. 3.
    Calhoun (J.) et Ford (R.).-Concurrency control mechanisms and the serializability of concurrent tree algorithms. In: of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.-Waterloo Ontario, Avr. 1984. Debut de la theorie sur la serializability.Google Scholar
  4. 4.
    Cun (B. L.), Mans (B.) et Roucairol (C.).-Opérations concurrentes et files de priorité.-RR n∘ 1548, INRIA-Rocquencourt, 1991.Google Scholar
  5. 5.
    Cung (V.-D.) et Roucairol (C.).-Parcours parallèle de graphes d'états par des algorithmes de la famille A * en Intelligence Artificielle.-RR n∘ 1900, INRIA, Avr. 1993. In French.Google Scholar
  6. 6.
    Ellis (C.).-Concurrent search and insertion in avl trees. IEEE Trans. on Cumputers, vol. C-29, n∘ 9, Sept. 1981, pp. 811–817.Google Scholar
  7. 7.
    Grama (A. Y.) et Kumar (V.).-A survey of parallel search algorithms for discrete optimization problems.-Personnal communication, 1993.Google Scholar
  8. 8.
    Jones (D.).-Concurrent operations on priority queues. ACM, vol. 32, n∘ 1, Jan. 1989, pp. 132–137.Google Scholar
  9. 9.
    Kalé (L.) et Saletore (V. A.).-Parallel state-space search for a first solution with consistent linear speedups. International journal of Parallel Programming, vol. 19, n∘ 4, 1990, pp: 251–293.Google Scholar
  10. 10.
    Korf (R. E.).-Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, no27, 1985, pp. 97–109.Google Scholar
  11. 11.
    Kumar (V.), Ramesh (K.) et Rao (V. N.).-Parallel best-first search of state-space graphs: A summary of results. The AAAI Conference, 1987, pp. 122–127.Google Scholar
  12. 12.
    Kung (H.) et Lehman (P.).-Concurrent manipulation of binary search trees. ACM trans. on Database Systems, vol. 5, n∘ 3, 1980, pp. 354–382.Google Scholar
  13. 13.
    Lehman (P.) et Yao (S.).-Efficient locking for concurrent operation on b-tree. ACM trans. on Database Systems, vol. 6, n∘ 4, Déc. 1981, pp. 650–670.Google Scholar
  14. 14.
    Mahanti (A.) et Daniels (C. J.).-SIMD Parallel Heuristic Search.-Rapport technique n∘ UMIACS-TR-91-41, CS-TR-2633, College Park, Maryland, Computer Science Department, University of Maryland, Mai 1991.Google Scholar
  15. 15.
    Mans (B.) et Roucairol (C.).-Concurrency in priority queues for branch and bound algorithms.-RR n∘ 1311, INRIA-Rocquencourt, Oct. 1990.Google Scholar
  16. 16.
    McCreight (E. M.).-Priority search trees. SIAM J Computing, vol. 14, n∘ 2, Mai 1985, pp. 257–276.Google Scholar
  17. 17.
    Nau (D. S.), Kumar (V.) et Kanal (L.).-General branch and bound, and its relation to a* and ao*. Artificial Intelligence, vol. 23, 1984, pp. 29–58.Google Scholar
  18. 18.
    Nilsson (N. J.).-Principles of Artificial Intelligence.-Tioga Publishing Co., 1980.Google Scholar
  19. 19.
    Patrick (B. G.), Almulla (M.) et Newborn (M. M.).-An upper bound on the time complexity of iterative-deepening-a*. Annals of Mathematics and Artificial Intelligence, vol. 5, 1992, pp. 265–278.Google Scholar
  20. 20.
    Pearl (J.).-Heuristics.-Addison-Wesley, 1984.Google Scholar
  21. 21.
    Powley (C.), Ferguson (C.) et Korf (R. E.).-Parallel tree search on a simd machine. In: The Third IEEE Symposium on Parallel and Distributed Processing.-Déc. 1991.Google Scholar
  22. 22.
    Powley (C.) et Korf (R. E.).-Simd and mimd parallel search. In: The AAAI symposium on Planning and Search.-Mars 1989.Google Scholar
  23. 23.
    Powley (C.) et Korf (R. E.).-Single-agent parallel window search. IEEE Transactions on pattern analysis and machine intelligence, vol. 13, n∘ 5, Mai 1991, pp. 466–477.Google Scholar
  24. 24.
    Rao (V.) et Kumar (V.).-Concurrent insertions and deletions in a priority queue. IEEE proceedings of International Conference on Parallele Processing, 1988, pp. 207–211.Google Scholar
  25. 25.
    Rao (V. N.), Kumar (V.) et Ramesh (K.).-Parallel Heuristic Search on Shared Memory Multiprocessors: Preliminary Results.-Rapport technique n∘ AI85-45, Artificial Intelligence Laboratory, The University of Texas at Austin, Juin 1987.Google Scholar
  26. 26.
    Roucairol (C.).-Recherche arborescente en parallèle.-RR n∘ M.A.S.I. 90.4, Institut Blaise Pascal-Paris VI, 1990. In French.Google Scholar
  27. 27.
    Roucairol (C.).-Exploration parallèle d'espace de recherche en recherche opérationnelle et intelligence artificielle. In: Algorithmique parallèle, éd. par Cosnard (M.), Nivat (M.) et Robert (Y.), pp. 201–211.-Masson, 1992. In French.Google Scholar
  28. 28.
    Sleator (D.) et Tarjan (R.).-Self-adjusting trees. In: 15th ACM Symposium on theory of computing, pp. 235–246.-Avr. 1983.Google Scholar
  29. 29.
    Sleator (D.) et Tarjan (R.).-Self-adjusting heaps. SIAM J. Comput., vol. 15, n∘ 1, Fév. 1986, pp. 52–69.Google Scholar
  30. 30.
    Tarjan (R.) et Sleator (D.).-Self-adjusting binary search trees. Journal of ACM, vol. 32, n∘ 3, 1985, pp. 652–686.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Van -Dat Cung
    • 1
    • 2
  • Bertrand Le Cun
    • 1
    • 2
  1. 1.Laboratoire PRiSMUniversité de VersaillesVersaillesFrance
  2. 2.INRIA-RocquencourtLe Chesnay CedexFrance

Personalised recommendations