By Topic

Parallel Astar search on message-passing architectures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cvetanovic, Z. ; Digital Equipment Corp., Boxborough, MA, USA ; Nofsinger, C.

The authors compare three parallel Astar search algorithms: the shared-list algorithm where a search space is shared among processors; the static-distribution algorithm, where a search space is distributed once to all processors; and the continuous-diffusion algorithm, where a search space is continuously redistributed. The continuous-diffusion algorithms outperform the other two algorithms on message-passing architectures. The grid-flow technique developed for continuous diffusion is of general importance for nearest-neighbor algorithms that need to share some global information

Published in:

System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on  (Volume:i )

Date of Conference:

2-5 Jan 1990