DocumentCode :
282547
Title :
Parallel Astar search on message-passing architectures
Author :
Cvetanovic, Z. ; Nofsinger, C.
Author_Institution :
Digital Equipment Corp., Boxborough, MA, USA
Volume :
i
fYear :
1990
fDate :
2-5 Jan 1990
Firstpage :
82
Abstract :
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
Keywords :
parallel algorithms; parallel architectures; search problems; continuous-diffusion algorithm; global information; grid-flow technique; message-passing architectures; nearest-neighbor algorithms; parallel Astar search algorithms; search space; shared-list algorithm; static-distribution algorithm; Artificial intelligence; Costs; Decision making; Distributed algorithms; Distributed computing; Learning; Operations research; Partitioning algorithms; Physics computing; Systems engineering and theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on
Conference_Location :
Kailua-Kona, HI
Type :
conf
DOI :
10.1109/HICSS.1990.205103
Filename :
205103
Link To Document :
بازگشت