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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho (A.), Hopcroft (J.) et Ullman (J.).-The Design and Analysis of Computer Algorithms.-Addison-Wesley, 1974.
Aragon (C.) et Aragon R. (G. S.).-Randomized search trees. FOCS 30, 1989, pp. 540–545.
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.
Cun (B. L.), Mans (B.) et Roucairol (C.).-Opérations concurrentes et files de priorité.-RR n∘ 1548, INRIA-Rocquencourt, 1991.
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.
Ellis (C.).-Concurrent search and insertion in avl trees. IEEE Trans. on Cumputers, vol. C-29, n∘ 9, Sept. 1981, pp. 811–817.
Grama (A. Y.) et Kumar (V.).-A survey of parallel search algorithms for discrete optimization problems.-Personnal communication, 1993.
Jones (D.).-Concurrent operations on priority queues. ACM, vol. 32, n∘ 1, Jan. 1989, pp. 132–137.
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.
Korf (R. E.).-Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, no27, 1985, pp. 97–109.
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.
Kung (H.) et Lehman (P.).-Concurrent manipulation of binary search trees. ACM trans. on Database Systems, vol. 5, n∘ 3, 1980, pp. 354–382.
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.
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.
Mans (B.) et Roucairol (C.).-Concurrency in priority queues for branch and bound algorithms.-RR n∘ 1311, INRIA-Rocquencourt, Oct. 1990.
McCreight (E. M.).-Priority search trees. SIAM J Computing, vol. 14, n∘ 2, Mai 1985, pp. 257–276.
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.
Nilsson (N. J.).-Principles of Artificial Intelligence.-Tioga Publishing Co., 1980.
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.
Pearl (J.).-Heuristics.-Addison-Wesley, 1984.
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.
Powley (C.) et Korf (R. E.).-Simd and mimd parallel search. In: The AAAI symposium on Planning and Search.-Mars 1989.
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.
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.
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.
Roucairol (C.).-Recherche arborescente en parallèle.-RR n∘ M.A.S.I. 90.4, Institut Blaise Pascal-Paris VI, 1990. In French.
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.
Sleator (D.) et Tarjan (R.).-Self-adjusting trees. In: 15th ACM Symposium on theory of computing, pp. 235–246.-Avr. 1983.
Sleator (D.) et Tarjan (R.).-Self-adjusting heaps. SIAM J. Comput., vol. 15, n∘ 1, Fév. 1986, pp. 52–69.
Tarjan (R.) et Sleator (D.).-Self-adjusting binary search trees. Journal of ACM, vol. 32, n∘ 3, 1985, pp. 652–686.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cung, V.D., Le Cun, B. (1994). An efficient implementation of parallel A* . In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive